Bounding the growth factor in Gaussian elimination for Buckley's class of complex symmetric matrices

DOI<269::AID-NLA197>3.0.CO;2-8 10.1002/1099-1506(200007/08)7:5<269::AID-NLA197>3.0.CO;2-8zbMath1051.65020OpenAlexW2061129095MaRDI QIDQ4814484

A. B. Kucherov, Khakim D. Ikramov

Publication date: 7 September 2004

Full work available at URL: https://doi.org/10.1002/1099-1506(200007/08)7:5<269::aid-nla197>3.0.co;2-8

zbMATH Keywords

Gaussian eliminationgrowth factorLoewner orderBuckley matrixcomplex symmetric positive definite matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

The Bunch-Kaufman factorization of symmetric matrices signature similar to sign regular matrices ⋮ On the properties of accretive-dissipative matrices ⋮ Fischer determinantal inequalities and Higham's conjecture

Cites Work

• Matrix Analysis
• Row-complete latin squares of every composite order exist

This page was built for publication: Bounding the growth factor in Gaussian elimination for Buckley's class of complex symmetric matrices