scispace - formally typeset
Journal ArticleDOI

Computer Solution of Linear Algebraic Systems. By G. Forsythe and C. B. Moler. Pp. xi, 148. 1967. (Prentice-Hall.)

L. Fox
- 01 May 1969 - 
- Vol. 53, Iss: 384, pp 221-222
Reads0
Chats0
About
This article is published in The Mathematical Gazette.The article was published on 1969-05-01. It has received 489 citations till now.

read more

Citations
More filters
Journal ArticleDOI

Solution of linear boundary inverse problems of heat conduction

TL;DR: In this article, new methods of solving linear one-dimensional boundary inverse problems of heat conduction are proposed; the methods are convenient for practical realization. But they are not suitable for solving the problem of convexity.
References
More filters
Journal ArticleDOI

Singular value decomposition and least squares solutions

TL;DR: The decomposition of A is called the singular value decomposition (SVD) and the diagonal elements of ∑ are the non-negative square roots of the eigenvalues of A T A; they are called singular values.
Journal ArticleDOI

Hyperquad simulation and speciation (HySS): a utility program for the investigation of equilibria involving soluble and partially soluble species

TL;DR: Hyperquad simulation and speciation (HySS) as mentioned in this paper is a computer program written for the Windows operating system on personal computers which provides simulating titration curves and a system for providing speciation diagrams.
Journal ArticleDOI

What every computer scientist should know about floating-point arithmetic

TL;DR: This paper presents a tutorial on the aspects of floating-point that have a direct impact on designers of computer systems, and concludes with examples of how computer system builders can better support floating point.
Journal ArticleDOI

Generalization of backpropagation with application to a recurrent gas market model

TL;DR: This paper will derive a generalization of backpropagation to recurrent systems (which input their own output), such as hybrids of perceptron-style networks and Grossberg/Hopfield networks, and does not require the storage of intermediate iterations to deal with continuous recurrence.
Journal ArticleDOI

An algorithm for reducing the bandwidth and profile of a sparse matrix

TL;DR: Extensive testing on finite element matrices indicates that the algorithm typically produces bandwidth and profile which are comparable to those of the commonly-used reverse Cuthill–McKee algorithm, yet requires significantly less computation time.
Related Papers (5)