Result 1 to 20 of 395 total
Efficient computation of the Gauss-Newton direction when fitting NURBS using ODR. (English)
BIT 52, No. 3, 571-588 (2012).
1
A primal-dual interior-point framework for using the L1 or L2 norm on the data and regularization terms of inverse problems. (English)
Inverse Probl. 28, No. 9, Article ID 095011 (2012).
2
Gauss-Newton method for convex composite optimizations on Riemannian manifolds. (English)
J. Glob. Optim. 53, No. 1, 5-28 (2012).
3
Software implementation of modifications of iterative algorithms for solving linear systems of equations. (English)
Int. J. Pure Appl. Math. 76, No. 4, 489-500 (2012).
4
Local convergence of the alternating least squares algorithm for canonical tensor approximation. (English)
SIAM J. Matrix Anal. Appl. 33, No. 2, 639-652 (2012).
5
Gauss-Jordan elimination methods for the Moore-Penrose inverse of a matrix. (English)
Linear Algebra Appl. 437, No. 7, 1835-1844 (2012).
6
Some remarks on Newton’s algorithm. II. (English)
Int. J. Pure Appl. Math. 74, No. 3, 373-391 (2012).
7
Numerical methods for equations and its applications. (English)
Boca Raton, FL: CRC Press (ISBN 978-1-57808-753-2/hbk; 978-1-46-651711-0/ebook). viii, 465~p. \sterling~57.99/hbk (2012).
8
Computing absolute maximum correlation. (English)
IMA J. Numer. Anal. 32, No. 1, 163-184 (2012).
9
On Gauss-Kuz’min statistics in short intervals. (Russian)
Dal’nevost. Mat. Zh. 11, No. 1, 93-98 (2011).
10
A regularized Gauss-Newton trust region approach to imaging in diffuse optical tomography. (English)
SIAM J. Sci. Comput. 33, No. 5, 3057-3086 (2011).
11
Numerical recipes for the high efficient inverse of the confluent Vandermonde matrices. (English)
Appl. Math. Comput. 218, No. 5, 2044-2054 (2011).
12
On efficient numerical approximation of the bilinear form $c^*A^{-1}b$. (English)
SIAM J. Sci. Comput. 33, No. 2, 565-587 (2011).
13
New adaptive all-pass based notch filter for narrowband/FM anti-jamming GPS receivers. (English)
Circuits Syst. Signal Process. 30, No. 3, 527-542 (2011).
14
Preconditioned Gauss-Seidel iterative method for $Z$-matrices linear systems. (English)
Bull. Korean Math. Soc. 48, No. 2, 303-314 (2011).
15
Algorithms unplugged. (English)
Berlin: Springer (ISBN 978-3-642-15327-3/hbk; 978-3-642-15328-0/ebook). x, 406~p. EUR~39.95/net; \sterling~35.99; SFR~57.50; \$~59.95 (2011).
16
A fast algorithm for the inverse of Sylvester matrices. (Chinese)
J. Numer. Methods Comput. Appl. 31, No. 2, 92-98 (2010).
17
Stability of the Levinson algorithm for Toeplitz-like systems. (English)
SIAM J. Matrix Anal. Appl. 31, No. 5, 2531-2552 (2010).
18
Convergence of a regularized Euclidean residual algorithm for nonlinear least-squares. (English)
SIAM J. Numer. Anal. 48, No. 1, 1-29 (2010).
19
An efficient and fast algorithm for solving generalized Vandermonde systems. (Chinese)
Chin. J. Eng. Math. 27, No. 1, 99-104 (2010).
20
Result 1 to 20 of 395 total
Start
Contact
Print
General Help
