Decomposition of a symmetric matrix

DOI10.1007/BF01399088MaRDI QIDQ1232151zbMATHOpenAlexFDO

Authors James R. Bunch, Linda Kaufman, Beresford N. Parlett

Publication date 1976

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/132435

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3408799 (Why is no real title available?)
• A Comparison of Algorithms for Solving Symmetric Indefinite Systems of Linear Equations
• Manifestations of the Schur complement
• On the reduction of a symmetric matrix to tridiagonal form
• Solution of real and complex systems of linear equations
• Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
• Symmetric decomposition of a positive definite matrix

Cited in

(27)

• The calculation of guaranteed bounds for eigenvalues using complementary variational principles
• A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
• On Factoring a Class of Complex Symmetric Matrices Without Pivoting
• Indefinite QR factorization
• Full block \(J\)-Jacobi method for Hermitian matrices
• Fast direct solution methods for symmetric banded Toeplitz systems, based on the sine transform
• A primal-dual Newton-type algorithm for geometric programs with equality constraints
• Symbiosis between linear algebra and optimization
• A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers
• Three-level parallel J-Jacobi algorithms for Hermitian matrices
• Analysis of thin plates by the element-free Galerkin method
• Transformation techniques for Toeplitz and Toeplitz-plus-Hankel matrices. II: Algorithms
• Newton like line search method using \(q\)-calculus
• Stability and inertia
• Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
• Use of indefinite pencils for computing damped natural modes
• Dogleg paths and trust region methods with back tracking technique for unconstrained optimization
• Stable algorithms for solving symmetric and skew-symmetric systems
• Block-oriented \(J\)-Jacobi methods for Hermitian matrices
• The impact of high-performance computing in the solution of linear systems: Trends and problems
• Componentwise analysis of direct factorization of real symmetric and Hermitian matrices
• Rational interpolation via orthogonal plynomials
• Novel modifications of parallel Jacobi algorithms
• Improving directions of negative curvature in an efficient manner
• Full and fast calibration of the Heston stochastic volatility model
• Stable and efficient computation of generalized polar decompositions
• Efficient robust optimization for robust control with constraints

This page was built for publication: Decomposition of a symmetric matrix

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