Accurate and fast computations with Green matrices
From MaRDI portal
Publication:6170087
Cites work
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- Accurate and fast computations with positive extended Schoenmakers-Coffey matrices
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- Accurate computations with collocation matrices of q-Bernstein polynomials
- Accurate Computations with Totally Nonnegative Matrices
- Computing the singular value decomposition with high relative accuracy
- scientific article; zbMATH DE number 1793704 (Why is no real title available?)
- Level–Slope–Curvature – Fact or Artefact?
- Systematic Generation of Parametric Correlation Structures for the LIBOR Market Model
- Total positivity and Neville elimination
- Totally positive matrices
- Totally positive matrices
Cited in
(5)- Fast algorithms for implementation of the Green's function
- Computing eigenvalues of quasi-rational Said-Ball-Vandermonde matrices
- High-relative-accuracy computations with Kac-Murdock-Szegö matrices and their generalizations
- Recent advances on accuracy, stability and optimality of B-bases
- Accurate computations for the inverse of \(\{P_1, P_2\}\)-Nekrasov \(Z\)-matrices
This page was built for publication: Accurate and fast computations with Green matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170087)