A comparative study of null‐space factorizations for sparse symmetric saddle point systems
Null‐space methods for solving saddle point systems of equations have long been used to
transform an indefinite system into a symmetric positive definite one of smaller dimension. A …
transform an indefinite system into a symmetric positive definite one of smaller dimension. A …
[PDF][PDF] The null-space method and its relationship with matrix factorizations for sparse saddle point systems
The null-space method for solving saddle point systems of equations has long been used to
transform an indefinite system into a symmetric positive definite one of smaller dimension. A …
transform an indefinite system into a symmetric positive definite one of smaller dimension. A …
Numerical issues in computing the antitriangular factorization of symmetric indefinite matrices
T Laudadio, N Mastronardi, P Van Dooren - Applied Numerical …, 2017 - Elsevier
An algorithm for computing the antitriangular factorization of symmetric matrices, relying only
on orthogonal transformations, was recently proposed. The computed antitriangular form …
on orthogonal transformations, was recently proposed. The computed antitriangular form …
The antitriangular factorization of skew-symmetric matrices
S Singer - Applied mathematics and computation, 2020 - Elsevier
In this paper we develop algorithms for orthogonal similarity transformations of skew-
symmetric matrices to simpler forms. The first algorithm is similar to the algorithm for the …
symmetric matrices to simpler forms. The first algorithm is similar to the algorithm for the …