๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A New Computationally Effective Algorithm for Solving the Discrete Riccati Equation

โœ Scribed by D.G. Lainiotis; N.D. Assimakis; S.K. Katsikas

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
807 KB
Volume
186
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

New solution bounds for the discrete alg
New solution bounds for the discrete algebraic matrix Riccati equation
โœ Chien-Hua Lee; Tsung-Lieh Hsien ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 96 KB ๐Ÿ‘ 2 views

New upper and lower matrix bounds and the corresponding eigenvalue bounds on the solution of the discrete algebraic Riccati equation are discussed in this paper. The present bounds are tighter than the majority of those found in the literature.

Beyond travelling waves: a new algorithm
Beyond travelling waves: a new algorithm for solving nonlinear evolution equations
โœ Bo Tian; Yi-Tian Gao ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 177 KB

In physical sciences, nonlinear evolution equations (NLEEs) and their exact solutions are of fundamental importance. However, there is no answer yet as to whether or not one is able to go beyond travelling waves with the recently proposed tanh method. In this paper, without loss of conciseness and s

A fast algorithm for solving the tensor
A fast algorithm for solving the tensor product collocation equations
โœ Weiwei Sun; N.G. Zamani ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 509 KB

A fast algorithm is presentedfor solving the tensor product collocation equations (A, @ B,+B, @ A,)u = b, obtained from the discretization of the Poisson equation in a rectangular region by the collocation method. The Fast Fourier Transformation (FFT) algorithm is employed to achieve the above objec