Differentiation of matrix functionals using triangular factorization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3856278 (Why is no real title available?)
- scientific article; zbMATH DE number 4211299 (Why is no real title available?)
- scientific article; zbMATH DE number 3734989 (Why is no real title available?)
- scientific article; zbMATH DE number 47282 (Why is no real title available?)
- scientific article; zbMATH DE number 1077338 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1456803 (Why is no real title available?)
- A survey of truncated-Newton methods
- Compact Computation of the Inverse of a Matrix
- Efficient algorithms for robust generalized cross-validation spline smoothing
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
- Large-scale geodetic least-squares adjustment by dissection and orthogonal decomposition
- Matrix inversion algorithms by means of automatic differentiation
- Monte Carlo estimates of the log determinant of large sparse matrices
- Numerical Linear Algebra for High-Performance Computers
- On computing certain elements of the inverse of a sparse matrix
- On computing the inverse of a sparse matrix
- Robust generalized cross-validation for choosing the regularization parameter
- Smoothing noisy data with spline functions
- Statistical learning from a regression perspective
- The Evolution of the Minimum Degree Ordering Algorithm
- The elimination form of the inverse and its application to linear programming
Cited in
(4)
This page was built for publication: Differentiation of matrix functionals using triangular factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3015047)