Skip to main content
Erschienen in: Calcolo 1/2021

01.03.2021

Accurate computations with Wronskian matrices

verfasst von: E. Mainar, J. M. Peña, B. Rubio

Erschienen in: Calcolo | Ausgabe 1/2021

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

In this paper we provide algorithms for computing the bidiagonal decomposition of the Wronskian matrices of the monomial basis of polynomials and of the basis of exponential polynomials. It is also shown that these algorithms can be used to perform accurately some algebraic computations with these Wronskian matrices, such as the calculation of their inverses, their eigenvalues or their singular values and the solutions of some linear systems. Numerical experiments illustrate the results.
Literatur
2.
Zurück zum Zitat Carnicer, J.M., Peña, J.M.: Shape preserving representations and optimality of the Bernstein basis. Adv. Comput. Math. 1, 173–196 (1993)MathSciNetCrossRef Carnicer, J.M., Peña, J.M.: Shape preserving representations and optimality of the Bernstein basis. Adv. Comput. Math. 1, 173–196 (1993)MathSciNetCrossRef
3.
Zurück zum Zitat Delgado, J., Peña, J.M.: Accurate computations with collocation matrices of rational bases. Appl. Math. Comput. 219, 4354–4364 (2013)MathSciNetMATH Delgado, J., Peña, J.M.: Accurate computations with collocation matrices of rational bases. Appl. Math. Comput. 219, 4354–4364 (2013)MathSciNetMATH
4.
Zurück zum Zitat Delgado, J., Peña, J.M.: Accurate computations with collocation matrices of q-Bernstein polynomials. SIAM J. Matrix Anal. Appl. 36, 880–893 (2015)MathSciNetCrossRef Delgado, J., Peña, J.M.: Accurate computations with collocation matrices of q-Bernstein polynomials. SIAM J. Matrix Anal. Appl. 36, 880–893 (2015)MathSciNetCrossRef
5.
Zurück zum Zitat Demmel, J., Koev, P.: The accurate and efficient solution of a totally positive generalized Vandermonde linear system. SIAM J. Matrix Anal. Appl. 27, 42–52 (2005)MathSciNetCrossRef Demmel, J., Koev, P.: The accurate and efficient solution of a totally positive generalized Vandermonde linear system. SIAM J. Matrix Anal. Appl. 27, 42–52 (2005)MathSciNetCrossRef
6.
Zurück zum Zitat Fallat, S.M., Johnson, C.R.: Totally Nonnegative Matrices. Princeton University Press, Princeton (2011). Princeton Series in Applied MathematicsCrossRef Fallat, S.M., Johnson, C.R.: Totally Nonnegative Matrices. Princeton University Press, Princeton (2011). Princeton Series in Applied MathematicsCrossRef
7.
8.
Zurück zum Zitat Gasca, M., Peña, J.M.: A matricial description of Neville elimination with applications to total positivity. Linear Algebra Appl. 202, 33–53 (1994)MathSciNetCrossRef Gasca, M., Peña, J.M.: A matricial description of Neville elimination with applications to total positivity. Linear Algebra Appl. 202, 33–53 (1994)MathSciNetCrossRef
9.
Zurück zum Zitat Gasca, M., Peña, J.M.: On factorizations of totally positive matrices. In: Gasca, M., Micchelli, C.A. (eds.) Total Positivity and Its Applications, pp. 109–130. Kluver Academic Publishers, Dordrecht (1996)CrossRef Gasca, M., Peña, J.M.: On factorizations of totally positive matrices. In: Gasca, M., Micchelli, C.A. (eds.) Total Positivity and Its Applications, pp. 109–130. Kluver Academic Publishers, Dordrecht (1996)CrossRef
11.
Zurück zum Zitat Koev, P.: Accurate eigenvalues and SVDs of totally nonnegative matrices. SIAM J. Matrix Anal. Appl. 27, 1–23 (2005)MathSciNetCrossRef Koev, P.: Accurate eigenvalues and SVDs of totally nonnegative matrices. SIAM J. Matrix Anal. Appl. 27, 1–23 (2005)MathSciNetCrossRef
12.
Zurück zum Zitat Koev, P.: Accurate computations with totally nonnegative matrices. SIAM J. Matrix Anal. Appl. 29, 731–751 (2007)MathSciNetCrossRef Koev, P.: Accurate computations with totally nonnegative matrices. SIAM J. Matrix Anal. Appl. 29, 731–751 (2007)MathSciNetCrossRef
13.
Zurück zum Zitat Marco, A., Martínez, J.J.: A fast and accurate algorithm for solving Bernstein–Vandermonde linear systems. Linear Algebra Appl. 422, 616–628 (2007)MathSciNetCrossRef Marco, A., Martínez, J.J.: A fast and accurate algorithm for solving Bernstein–Vandermonde linear systems. Linear Algebra Appl. 422, 616–628 (2007)MathSciNetCrossRef
14.
Zurück zum Zitat Marco, A., Martínez, J.J.: Accurate computations with Said–Ball–Vandermonde matrices. Linear Algebra Appl. 432, 2894–2908 (2010)MathSciNetCrossRef Marco, A., Martínez, J.J.: Accurate computations with Said–Ball–Vandermonde matrices. Linear Algebra Appl. 432, 2894–2908 (2010)MathSciNetCrossRef
15.
Zurück zum Zitat Marco, A., Martinez, J.J.: Accurate computation of the Moore–Penrose inverse of strictly totally positive matrices. J. Comput. Appl. Math. 350, 299–308 (2019)MathSciNetCrossRef Marco, A., Martinez, J.J.: Accurate computation of the Moore–Penrose inverse of strictly totally positive matrices. J. Comput. Appl. Math. 350, 299–308 (2019)MathSciNetCrossRef
16.
Zurück zum Zitat Pinkus, A.: Totally Positive Matrices, Cambridge Tracts in Mathematics, 181. Cambridge University Press, Cambridge (2010) Pinkus, A.: Totally Positive Matrices, Cambridge Tracts in Mathematics, 181. Cambridge University Press, Cambridge (2010)
Metadaten
Titel
Accurate computations with Wronskian matrices
verfasst von
E. Mainar
J. M. Peña
B. Rubio
Publikationsdatum
01.03.2021
Verlag
Springer International Publishing
Erschienen in
Calcolo / Ausgabe 1/2021
Print ISSN: 0008-0624
Elektronische ISSN: 1126-5434
DOI
https://doi.org/10.1007/s10092-020-00392-4

Weitere Artikel der Ausgabe 1/2021

Calcolo 1/2021 Zur Ausgabe

Premium Partner