| |
|
|
| |
| |
|
Date Reviewed |
|
| |
1 - 7 of 7
reviews
|
|
|
 |
|
|
|
|
 Iterative methods for linear systems: theory and applications
Olshanskii M., Tyrtyshnikov E., SIAM, Philadelphia, PA, 2014. 263 pp. Type: Book (978-1-611973-45-7)
The term “linear systems” in the title refers to equations of the form Ax = b, where x and b are elements of a Euclidean space and
|
Feb 25 2015 |
|
|
|
|
|
|
Insight through computing: a MATLAB introduction to computational science and engineering
Van Loan C., Fan K., SIAM, Philadelphia, PA, 2009. 452 pp. Type: Book (978-0-898716-91-7)
This is a carefully designed introductory text to computational science that uses the MATLAB language. Among scientists, engineers, and numerical analysts, MATLAB has become a lingua franca for describing and executing algorithms. As o...
|
May 28 2010 |
|
|
|
|
|
|
Scientific programming in Fortran
Van Snyder W. Scientific Programming 15(1): 3-8, 2007. Type: Article
As one of the first programming languages, Fortran has a complicated history. Although Fortran 66 was quickly standardized--and, for a while, nearly every computer platform could be had with a Fortran compiler--the la...
|
Mar 10 2009 |
|
|
|
|
|
|
The quadratic eigenvalue problem in electric power systems
Misrikhanov M., Ryabchenko V. Automation and Remote Control 67(5): 698-720, 2006. Type: Article
The quadratic eigenvalue problem (QEP) is not usually covered in introductory linear algebra or numerical methods courses. Even advanced linear algebra texts, such as Gantmacher [1], covered it only in later chapters. Since the 1960s, ...
|
Oct 5 2006 |
|
|
|
|
|
|
Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
Dostál Z., Schöberl J. Computational Optimization and Applications 30(1): 23-43, 2005. Type: Article
The application of finite element methods to the solution of many variational inequalities leads to the minimization of a quadratic function of a large number of variables with bound constraints. Unconstrained problems of this size are...
|
Aug 2 2005 |
|
|
|
|
|
|
A decentralized algorithm for spectral analysis
Kempe D., McSherry F. Annual ACM Symposium on Theory of Computing (Proceedings of the Thirty-sixth Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, Jun 13-16, 2004) 561-568, 2004. Type: Proceedings
A decentralized algorithm for the computation of the spectral decomposition of a graph is presented in this paper. The algorithm is based on the use of subspace iteration to compute a few dominant eigenvectors of the adjacency matrix o...
|
Sep 3 2004 |
|
|
|
|
|
|
Approximate implicitization via curve fitting
Wurm E., Jüttler B. Geometry processing (Proceedings of the Eurographics/ACM SIGGRAPH symposium, Aachen, Germany, Jun 23-25, 2003) 240-247, 2003. Type: Proceedings
The problem discussed here starts with scattered data points in a plane that are thought to lie along a curve. The authors describe two methods to fit these points with a piecewise smooth curve defined implicitly: one uses tensor produ...
|
Jan 7 2004 |
|
|
|
|
|
| |
|
|
| |
|
|
