Structure-Preserving Doubling Algorithms for Nonlinear Matrix Equations

Structure-Preserving Doubling Algorithms for Nonlinear Matrix Equations

EnglishPaperback / softback
Huang, Tsung-Ming
Society for Industrial & Applied Mathematics,U.S.
EAN: 9781611975352
On order
Delivery on Monday, 27. of July 2026
CZK 1,946
Common price CZK 2,162
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

Nonlinear matrix equations arise frequently in applied science and engineering. This is the first book to provide a unified treatment of structure-preserving doubling algorithms, which have been recently studied and proven effective for notoriously challenging problems, such as fluid queue theory and vibration analysis for high-speed trains. The authors present recent developments and results for the theory of doubling algorithms for nonlinear matrix equations associated with regular matrix pencils, and highlight the use of these algorithms in achieving robust solutions for notoriously challenging problems that other methods cannot.

Structure-Preserving Doubling Algorithms for Nonlinear Matrix Equations is intended for researchers and computational scientists. Graduate students may also find it of interest.
EAN 9781611975352
ISBN 1611975352
Binding Paperback / softback
Publisher Society for Industrial & Applied Mathematics,U.S.
Publication date November 30, 2018
Pages 144
Language English
Dimensions 229 x 152
Country United States
Authors Huang, Tsung-Ming; Li, Ren-Cang; Lin, Wen-Wei
Series Fundamentals of Algorithms
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.