A note on direct methods for approximations of sparse Hessian matrices
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3976197
- Direct methods for sparse matrices
- A survey of direct methods for sparse linear systems
- A direct method for sparse least squares problems with lower and upper bounds
- On the efficient computation of sparsity patterns for Hessians
- scientific article; zbMATH DE number 3876468
- scientific article; zbMATH DE number 194668
- Direct Methods for Sparse Linear Systems
- A Direct Projection Method for Sparse Linear Systems
- An Optimal Positive Definite Update for Sparse Hessian Matrices
Cites work
- A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
- Estimation of sparse hessian matrices and graph coloring problems
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- scientific article; zbMATH DE number 3679327 (Why is no real title available?)
- On the Estimation of Sparse Hessian Matrices
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
- Smallest-last ordering and clustering and graph coloring algorithms
Cited in
(5)- An extended compact profile iterative method criterion for sparse \(H\)-matrices
- scientific article; zbMATH DE number 5812144 (Why is no real title available?)
- Estimation of sparse hessian matrices and graph coloring problems
- scientific article; zbMATH DE number 1101645 (Why is no real title available?)
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
This page was built for publication: A note on direct methods for approximations of sparse Hessian matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3806696)
