Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison.

DOI10.1016/J.LAA.2015.06.031zbMATH Open1337.65030OpenAlexW824953440MaRDI QIDQ286181FDOQ286181

Frank Uhlig, Froilán M. Dopico

Publication date: 20 May 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.06.031

Recommendations

• Computing matrix symmetrizers, finally possible via the Huang and Nong algorithm
• On symmetrizing a matrix
• Error-free matrix symmetrizers and equivalent symmetric matrices
• scientific article
• Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic

zbMATH Keywords

linear equationnumerical algorithm\texttt{MATLAB} codeeigenvalue methodmatrix optimizationprincipal subspace computationsymmetric matrix factorizationsymmetrizersymmetrizer computation

Mathematics Subject Classification ID

Factorization of matrices (15A23) Hermitian, skew-Hermitian, and related matrices (15B57) Iterative numerical methods for linear systems (65F10) Numerical solutions to equations with linear operators (65J10)

Cites Work

• LAPACK Users' Guide
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algebraic properties of compatible Poisson brackets
• Title not available (Why is that?)
• Accuracy and Stability of Numerical Algorithms
• Title not available (Why is that?)
• Computing a matrix symmetrizer exactly using modified multiple modulus residue arithmetic
• Condition numbers and equilibration of matrices
• The role of symmetric matrices in the study of general matrices
• Computing matrix symmetrizers, finally possible via the Huang and Nong algorithm
• On Symmetrizable Systems of Second Kind
• Dynamics of Symmetrizable Nonconservative Systems
• An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
• Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
• Taussky's theorem, symmetrizability and modal analysis revisited
• On a method of solving the complete eigenvalue problem for a degenerate matrix
• Computing Eigenvalues of Complex Matrices by Determinant Evaluation and by Methods of Danilewski and Wielandt
• An algorithm for numerical determination of the structure of a general matrix
• The principle of minimized iterations in the solution of the matrix eigenvalue problem
• On the similarity transformation between a matrix and its transpose
• An iterative algorithm for solving a finite-dimensional linear operator equation \(T(x)=f\) with applications
• Locality of reference in sparse Cholesky factorization methods
• A case where balancing is harmful

Cited In (4)

• Computation of large-dimension Jordan normal transform via popular platforms
• A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers
• Title not available (Why is that?)
• On symmetrizing a matrix

Uses Software

• LAPACK
• Matlab
• mctoolbox
• HQR3 EXCHNG

This page was built for publication: Computing matrix symmetrizers. II: New methods using eigendata and linear means; a comparison.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286181)