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