- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540961468
3540961461
9780387961460
0387961461
- Dimensions
-
25 cm
- Extent
-
XV, 154 S.
- Language
-
Englisch
- Notes
-
Literaturverz. S. 146 - 150
- Keyword
-
Polynommatrix
Computeralgebra
Interpolation
Näherungsrechnung
Matrix (Mathematik)
Polynom
Interpolation
Näherungsrechnung
Matrix
Polynom
- Event
-
Veröffentlichung
- (where)
-
New York, Berlin, Heidelberg, Tokyo
- (who)
-
Springer
- (when)
-
1985
- Creator
-
Krishnamurthy, Edayathumangalam V.
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 1:55 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Krishnamurthy, Edayathumangalam V.
- Springer
Time of origin
- 1985
Other Objects (12)
Polynomial and matrix computations, Vol. 1.. Fundamental algorithms
MPP: A Framework for Distributed Polynomial Computations
Polynomial operator matrices
Matrix-free finite-element computations at extreme scale and for challenging applications
Matrix groups and polynomial sequences
Complexity of turing machine computations, Course unit 3.. Polynomial time
Efficient distributed matrix-free multigrid methods on locally refined meshes for FEM computations
Sylvester matrix and common factors in polynomial matrices
Linear algebra and matrix computations with MATLAB
Overcoming free riding in multi-party computations
Restarting and error estimation in polynomial and extended Krylov subspace methods for the approximation of matrix functions
Local Polynomial Estimation with a FARIMA-GARCH Error Process
Polynomial and matrix computations, Vol. 1.. Fundamental algorithms
MPP: A Framework for Distributed Polynomial Computations
Polynomial operator matrices
Matrix-free finite-element computations at extreme scale and for challenging applications
Matrix groups and polynomial sequences
Complexity of turing machine computations, Course unit 3.. Polynomial time
Efficient distributed matrix-free multigrid methods on locally refined meshes for FEM computations
Sylvester matrix and common factors in polynomial matrices
Linear algebra and matrix computations with MATLAB
Overcoming free riding in multi-party computations
Restarting and error estimation in polynomial and extended Krylov subspace methods for the approximation of matrix functions
Local Polynomial Estimation with a FARIMA-GARCH Error Process
Polynomial and matrix computations, Vol. 1.. Fundamental algorithms
MPP: A Framework for Distributed Polynomial Computations
Polynomial operator matrices
Matrix-free finite-element computations at extreme scale and for challenging applications
Matrix groups and polynomial sequences
Complexity of turing machine computations, Course unit 3.. Polynomial time
Efficient distributed matrix-free multigrid methods on locally refined meshes for FEM computations
Sylvester matrix and common factors in polynomial matrices
Linear algebra and matrix computations with MATLAB
Overcoming free riding in multi-party computations
Restarting and error estimation in polynomial and extended Krylov subspace methods for the approximation of matrix functions