No BSD License
-
bicg(A, x, b, M, max_it, tol)
-- Iterative template routine --
-
bicgstab(A, x, b, M, max_it, ...
-- Iterative template routine --
-
cg(A, x, b, M, max_it, tol)
-- Iterative template routine --
-
cgs(A, x, b, M, max_it, tol)
-- Iterative template routine --
-
cheby(A, x, b, M, max_it, tol)
-- Iterative template routine --
-
gmres( A, x, b, M, restrt, ma...
-- Iterative template routine --
-
jacobi(A, x, b, max_it, tol)
-- Iterative template routine --
-
lehmer(n)
LEHMER A = LEHMER(N) is the symmetric positive definite N-by-N matrix with
-
makefish(siz);
make a Poisson matrix
-
qmr( A, x, b, M, max_it, tol )
-- Iterative template routine --
-
rotmat( a, b )
% Compute the Givens rotation matrix parameters for a and b.
-
sor(A, x, b, w, max_it, tol)
-- Iterative template routine --
-
split( A, b, w, flag )
-
templatestester()
-
testmat( siz );
% matrix generator function for templates tester
-
wathen(nx, ny, k)
-
readme.m
-
View all files
|
|
| lehmer(n) |
function A = lehmer(n)
%LEHMER A = LEHMER(N) is the symmetric positive definite N-by-N matrix with
% A(i,j) = i/j for j>=i.
% A is totally nonnegative. INV(A) is tridiagonal, and explicit
% formulas are known for its entries.
% N <= COND(A) <= 4*N*N.
% References:
% M. Newman and J. Todd, The evaluation of matrix inversion
% programs, J. Soc. Indust. Appl. Math., 6 (1958), pp. 466-476.
% Solutions to problem E710 (proposed by D.H. Lehmer): The inverse
% of a matrix, Amer. Math. Monthly, 53 (1946), pp. 534-535.
A = ones(n,1)*(1:n);
A = A./A';
A = tril(A) + tril(A,-1)';
|
|
Contact us at files@mathworks.com