๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Efficient MATLAB Computations with Sparse and Factored Tensors

โœ Scribed by Bader, Brett W.; Kolda, Tamara G.


Book ID
117998932
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
295 KB
Volume
30
Category
Article
ISSN
1064-8275

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Mathematics for Business, Science, and T
โœ Steven Karris ๐Ÿ“‚ Library ๐Ÿ“… 2007 ๐Ÿ› Orchard Publications ๐ŸŒ English โš– 6 MB

This text includes the following chapters and appendices: Numbers and Arithmetic Operations, Elementary Algebra, Intermediate Algebra, Fundamentals of Geometry, Fundamentals of Plane Trigonometry, Fundamentals of Calculus, Mathematics of Finance and Economics, Depreciation, Impairment, and Depletion

Scientific Computing with MATLAB and Oct
โœ Alfio Quarteroni, Fausto Saleri, Paola Gervasio (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 2010 ๐Ÿ› Springer ๐ŸŒ English โš– 6 MB

This textbook is an introduction to Scientific Computing, in which several numerical methods for the computer-based solution of certain classes of mathematical problems are illustrated. The authors show how to compute the zeros or the integrals of continuous functions, solve linear systems, approxim

Scientific Computing with MATLAB and Oct
โœ Alfio Quarteroni, Fausto Saleri, Paola Gervasio (auth.) ๐Ÿ“‚ Library ๐Ÿ“… 2010 ๐Ÿ› Springer ๐ŸŒ English โš– 7 MB

This textbook is an introduction to Scientific Computing, in which several numerical methods for the computer-based solution of certain classes of mathematical problems are illustrated. The authors show how to compute the zeros or the integrals of continuous functions, solve linear systems, approxim

Linear combination of Lanczos vectors: A
โœ T. Koslowski; W. Von Niessen ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 634 KB

We present a storage-efficient and robust algorithm for the computation of eigenvectors of large sparse symmetrical matrices using a Lanczos scheme. The algorithm is based upon a linear combination of Lanczos vectors (LCLV) with a variable iteration depth. A simple method is given to determine the i