Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
Optimal Control of Partial Differential Equations Kapitel lesen Erstes Kapitel lesen

2017 | OriginalPaper | Buchkapitel

Accurate Computations and Applications of Some Classes of Matrices

verfasst von : J. M. Peña

Erschienen in: Computational Mathematics, Numerical Analysis and Applications

Verlag: Springer International Publishing

Einloggen

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

search-config
loading …

Abstract

Performing an algorithm with high relative accuracy is a very desirable goal. High relative accuracy means that the relative errors of the computations are of the order of machine precision, independently of the size of the condition number. This goal is difficult to assure although in recent years there have been some advances, in particular in the field of Numerical Linear Algebra. Up to now, computations with high relative accuracy are guaranteed only for a few classes of matrices, mainly for some subclasses of M-matrices and for some subclasses of totally positive matrices. Previously, a reparametrization of the matrices is needed. We review this procedure related with the high relative accuracy computations of these matrices. We also present some recent applications of the two classes of matrices mentioned previously. On the one hand, applications of M-matrices to the linear complementarity problem. On the other hand, applications of totally positive matrices to Computer Aided Geometric Design.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Introduction to First-Principle Simulation of Molecular Systems
Nächstes Kapitel Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra
Literatur
1.
Alanelli, M., Hadjidimos, A.: A new iterative criterion for H-matrices. SIAM J. Matrix Anal. Appl. 29, 160–176 (2006/2007)
2.
Alfa, A.S., Xue, J., Ye, Q.: Entrywise perturbation theory for diagonally dominant M-matrices with applications. Numer. Math. 90, 401–414 (1999)MathSciNetCrossRefMATH
3.
Alfa, A.S., Xue, J., Ye, Q.: Accurate computation of the smallest eigenvalue of a diagonally dominant M-matrix. Math. Comp. 71, 217–236 (2001)MathSciNetCrossRefMATH
4.
5.
Alonso, P., Delgado, J., Gallego, R., Peña, J.M.: Iterative refinement for Neville elimination. Int. J. Comput. Math. 86, 341–353 (2009)MathSciNetCrossRefMATH
6.
Alonso, P., Delgado, J., Gallego, R., Peña, J.M.: Growth factors of pivoting strategies associated to Neville elimination. J. Comput. Appl. Math. 235, 1755–1762 (2011)MathSciNetCrossRefMATH
7.
Alonso, P., Delgado, J., Gallego, R., Peña, J.M.: Conditioning and accurate computations with Pascal matrices. J. Comput. Appl. Math. 252, 21–26 (2013)MathSciNetCrossRefMATH
8.
9.
Andrews, G.G., Egge, E.S., Gawronnski, W., Littlejohn, L.L.: The Jacobi-Stirling numbers. J. Combin. Theory Ser. A 120 288–303 (2013)MathSciNetCrossRefMATH
10.
Barreras, A., Peña, J.M.: Accurate and efficient LDU decompositions of diagonally dominant M-matrices. Electron. J. Linear Algebra 24, 153–167 (2012)MathSciNetCrossRefMATH
11.
Barreras, A., Peña, J.M.: Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices. Numer. Linear Algebra Appl. 20, 413–424 (2013)MathSciNetCrossRefMATH
12.
Barreras, A., Peña, J.M.: Accurate and efficient LDU decomposition of almost diagonally dominant Z–matrices. BIT Numer. Math. 54, 343–356 (2014)MathSciNetCrossRefMATH
13.
Barrio, R. Peña, J.M.: Numerical evaluation of the p-th derivative of Jacobi series. Appl. Numer. Math. 43, 335–357 (2002)MathSciNetCrossRefMATH
14.
Barrio, R., Peña, J.M.: Evaluation of the derivative of a polynomial in Bernstein form. Appl. Math. Comput. 167, 125–142 (2005)MathSciNetMATH
15.
Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences. Classics in Applied Mathematics, vol. 9, SIAM, Philadelphia (1994)
16.
Carnicer, J.M., Peña, J.M.: Shape preserving representations and optimality of the Bernstein basis. Adv. Comput. Math. 1, 173–196 (1993)MathSciNetCrossRefMATH
17.
Carnicer, J.M., Peña, J.M.: Totally positive bases for shape preserving curve design and optimality of B-splines. Comput. Aided Geom. Des. 11, 633–654 (1994)MathSciNetCrossRefMATH
18.
Carnicer, J.M., Peña, J.M.: Total positivity and optimal bases. In: Gasca, M., Micchelli, C.A. (eds.) Total Positivity and Its Applications. Mathematics and Its Applications, vol. 359, pp. 133–155. Kluwer Academic Publishers, Dordrecht (1996)CrossRef
19.
Carnicer, J.M., García, M., Peña, J.M.: Generalized convexity preserving transformations. Comput. Aided Geom. Des. 13, 179–197 (1995)MathSciNetCrossRefMATH
20.
Chen, X., Xiang, S.: Computation of error bounds for P-matrix linear complementarity problems. Math. Program. Ser. A 106, 513–525 (2006)MathSciNetCrossRefMATH
21.
Cottle, R.W., Pang, J.S., Stone, R.E.: The Linear Complementarity Problems. Academic Press, Boston (1992)MATH
22.
23.
Delgado, J., Peña, J.M.: A corner cutting algorithm for evaluating rational Bézier surfaces and the optimal stability of the basis. SIAM J. Sci. Comput. 29, 1668–1682 (2007)MathSciNetCrossRefMATH
24.
Delgado, J., Peña, J.M.: Progressive iterative approximation and bases with the fastest convergence rates. Comput. Aided Geom. Des. 24, 10–18 (2007)MathSciNetCrossRefMATH
25.
Delgado, J., Peña, J.M.: Error analysis of efficient evaluation algorithms for tensor product surfaces. J. Comput. Appl. Math. 219, 156–169 (2008)MathSciNetCrossRefMATH
26.
Delgado, J., Peña, J.M.: Running relative error for the evaluation of polynomials. SIAM J. Sci. Comput. 31 3905–3921 (2009)MathSciNetCrossRefMATH
27.
Delgado, J., Peña, J.M.: Optimal conditioning of Bernstein collocation matrices. SIAM J. Matrix Anal. Appl. 31, 990–996 (2009)MathSciNetCrossRefMATH
28.
Delgado, J., Peña, J.M.: Running error for the evaluation of rational Bézier surfaces. J. Comput. Appl. Math. 233, 1685–1696 (2010)MathSciNetCrossRefMATH
29.
Delgado, J., Peña, J.M.: Running error for the evaluation of rational Bézier surfaces through a robust algorithm. J. Comput. Appl. Math. 235, 1781–1789 (2011)MathSciNetCrossRefMATH
30.
Delgado, J., Peña, J.M.: On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis. Adv. Comput. Math. 38, 701–721 (2013)MathSciNetCrossRefMATH
31.
Delgado, J., Peña, J.M.: Accurate computations with collocation matrices of rational bases. Appl. Math. Comput. 219, 4354–4364 (2013)MathSciNetMATH
32.
Delgado, J., Peña, J.M.: Fast and accurate algorithms for Jacobi-Stirling matrices. Appl. Math. Comput. 236, 253–259 (2014)MathSciNetMATH
33.
Delgado, J., Peña, J.M.: Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm. Appl. Math. Comput. 271, 113–122 (2015)MathSciNet
34.
Delgado, J., Peña, J.M.: Accurate computations with collocation matrices of q-Bernstein polynomials. SIAM J. Matrix Anal. Appl. 36, 880–893 (2015)MathSciNetCrossRefMATH
35.
Delgado, J., Peña, J.M.: Algorithm 960: POLYNOMIAL: an object-oriented Matlab library of fast and efficient algorithms for polynomials. Trans. Math. Softw. 42, 19 (2016)MathSciNetCrossRefMATH
36.
Delgado, J., Peña, G., Peña, J.M.: Accurate and fast computations with positive extended Schoenmakers-Coffey matrices. Numer. Linear Algebra Appl. 23, 1023–1031 (2016)MathSciNetCrossRefMATH
37.
38.
Demmel, J., Koev, P.: The accurate and efficient solution of a totally positive generalized Vandermonde linear system. SIAM J. Matrix Anal. Appl. 27, 142–152 (2005)MathSciNetCrossRefMATH
39.
Demmel, J., Gu, M., Eisenstat, S., Slapnicar, I., Veselic, K., Drmac, Z.: Computing the singular value decomposition with high relative accuracy. Linear Algebra Appl. 299, 21–80 (1999)MathSciNetCrossRefMATH
40.
Demmel, J., Dumitriu, I., Holtz, O., Koev, P.: Accurate and efficient expression evaluation and linear algebra. Acta Numer. 17, 87–145 (2008)MathSciNetCrossRefMATH
41.
Dopico, F.M., Koev, P.: Perturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices. Numer. Math. 119, 337–371 (2001)MathSciNetCrossRefMATH
42.
Everitt, W.N., Kwon, K.H., Littlejohn, L.L., Wellman R., Yoon, G.J.: Jacobi-Stirling numbers, Jacobi polynomials, and the left-definite analysis of the classical Jacobi differential expression. J. Comput. Appl. Math. 208, 29–56 (2007)MathSciNetCrossRefMATH
43.
Fallat, S.M., Johnson, C.R.: Totally Nonnegative Matrices. Princeton University Press, Princeton/Oxford (2011)CrossRefMATH
44.
Farin, G.: Curves and Surfaces for Computer Aided Geometric Design. Academic Press, Boston (1988)MATH
45.
Frydman, H., Singer, B.: Total positivity and the embedding problem for Markov chains. Math. Proc. Camb. Philos. Soc. 85, 339–344 (1979)MathSciNetCrossRefMATH
46.
Gantmacher, F.P., Krein, M.G.: Oscillation Matrices and Kernels and Small Vibrations of Mechanical Systems (revised ed.). AMS Chelsea, Providence (2002)MATH
47.
García-Esnaola, M., Peña, J.M.: Error bounds for linear complementarity problems of B-matrices. Appl. Math. Lett. 22, 1071–1075 (2009)MathSciNetCrossRefMATH
48.
García-Esnaola, M., Peña, J.M.: A comparison of error bounds for linear complementarity problems of H-matrices. Linear Algebra Appl. 433, 956–964 (2010)MathSciNetCrossRefMATH
49.
García-Esnaola, M., Peña, J.M.: Error bounds for linear complementarity problems of B S -matrices. Appl. Math. Lett. 25, 1379–1383 (2012)MathSciNetCrossRefMATH
50.
García-Esnaola, M., Peña, J.M.: Error bounds for the linear complementarity problem with a Σ-SDD matrix. Linear Algebra Appl. 438, 1339–1346 (2013)MathSciNetCrossRefMATH
51.
García-Esnaola, M., Peña, J.M.: Error bounds for linear complementarity problems of Nekrasov matrices. Numer. Algorithms 67, 655–667 (2014)MathSciNetCrossRefMATH
52.
García-Esnaola, M., Peña, J.M.: B-Nekrasov matrices and error bounds for linear complementarity problems. Numer. Algorithms 72, 435–445 (2016)MathSciNetCrossRefMATH
53.
Gasca, M., Micchelli, C.A. (eds.): Total Positivity and Its Applications. Mathematics and Its Applications, vol. 359. Kluwer Academic Publishers, Dordrecht (1996)
54.
Gasca, M., Mühlbach, G.: Generalized Schur complements and a test for total positivity. Applied Numer. Math. 3, 215–232 (1987)MathSciNetCrossRefMATH
55.
56.
Gasca, M., Peña, J.M.: A matricial description of Neville elimination with applications to total positivity. Linear Algebra Appl. 202, 33–45 (1994)MathSciNetCrossRefMATH
57.
Gasca, M., Peña, J.M.: On factorizations of totally positive matrices. In: Gasca, M., Micchelli, C.A. (eds). Total Positivity and Its Applications. Mathematics and Its Applications, vol. 359, pp. 109–130. Kluwer Academic Publishers, Dordrecht (1996)CrossRef
58.
Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. The John Hopkins University Press, Baltimore (1996)MATH
59.
60.
Goodman, T.N.T., Micchelli, C.A.: Corner cutting algorithms for the Bézier representation of free form curves. Linear Alg. Appl. 99, 225–252 (1988)CrossRefMATH
61.
Goodman, T.N.T., Said, H.B.: Shape preserving properties of the generalized Ball basis. Comput. Aided Geom. Des. 8, 115–121 (1991)CrossRefMATH
62.
Goodman, T.N.T., Oruç, H., Phillips, G.M.: Convexity and generalized Bernstein polynomials. Proc. Edinb. Math. Soc. 42, 179–190 (1999)MathSciNetCrossRefMATH
63.
Higham, N.J.: Accuracy and Stability of Numerical Algorithms, 2nd edn. SIAM, Philadelphia (2002)CrossRefMATH
64.
Karlin, S.: Total Positivity, vol. 1. Stanford University Press, Stanford (1968)MATH
65.
Karlin, S., McGregor, J.L.: Coincidence probabilities of birth and death processes. Pac. J. Math. 9, 1109–1140 (1959)CrossRefMATH
66.
67.
68.
69.
70.
Li, L.: On the iterative criterion for generalized diagonally dominant matrices. SIAM J. Matrix Anal. Appl. 24, 17–24 (2002)MathSciNetCrossRefMATH
71.
72.
73.
74.
Marco, A., Martínez, J.J.: A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems. Linear Algebra Appl. 422, 616–628 (2007)MathSciNetCrossRefMATH
75.
Marco, A., Martínez, J.J.: Accurate computations with Said-Ball-Vandermonde matrices. Linear Algebra Appl. 432, 2894–2908 (2010)MathSciNetCrossRefMATH
76.
77.
Mathias, R., Pang, J.S.: Error bounds for the linear complementarity problem with a P-matrix. Linear Algebra Appl. 132, 123–136 (1990)MathSciNetCrossRefMATH
78.
79.
80.
81.
Peña, J.M. (ed.): Shape Preserving Representations in Computer Aided Geometric Design. Nova Science Publishers, Commack (1999)MATH
82.
83.
84.
85.
Peña, J.M.: LDU decompositions with L and U well conditioned. Electron. Trans. Numer. Anal. 18, 198–208 (2004)MathSciNetMATH
86.
87.
88.
89.
90.
Phillips, G.M.: Bernstein polynomials based on the q-integers. The heritage of P. L. Chebyshev: a Festschrift in honor of the 70th birthday of T. J. Rivlin. Ann. Numer. Math. 4, 511–518 (1997)
91.
Pinkus, A.: Totally Positive Matrices. Cambridge Tracts in Mathematics, vol. 181. Cambridge University Press, Cambridge (2010)
92.
Schmeltz, G.: Variationsreduzierende Kurvendarstellungen und Krümmungskriterien für Bézierflächen, Thesis, Fachbereich Mathematik, Technische Hochschule Darmstadt (1992)
93.
Schumaker, L.L., Volk, W.: Efficient evaluation of multivariate polynomials. Comput. Aided Geom. Des. 3, 149–154 (1986)CrossRefMATH
94.
95.
Ye, Q.: Computing singular values of diagonally dominant matrices to high relative accuracy. Math. Comp. 77, 2195–2230 (2008).MathSciNetCrossRefMATH
Metadaten
Titel
Accurate Computations and Applications of Some Classes of Matrices
verfasst von
J. M. Peña
Copyright-Jahr
2017
Buch
Computational Mathematics, Numerical Analysis and Applications

Print ISBN: 978-3-319-49630-6

Electronic ISBN: 978-3-319-49631-3

Copyright-Jahr: 2017

DOI
https://doi.org/10.1007/978-3-319-49631-3_3

Premium Partner

    Bildnachweise