%-------------------------------------------------------------------------------
% UF Sparse Matrix Collection, Tim Davis
% http://www.cise.ufl.edu/research/sparse/matrices/Rajat/Raj1
% name: Rajat/Raj1
% [Circuit simulation matrix from Raj]
% id: 1863
% date: 2007
% author: Raj
% ed: T. Davis
% fields: name title A id date author ed kind notes Zeros
% kind: circuit simulation problem
%-------------------------------------------------------------------------------
% notes:
% High fill-in with KLU, because the matrix is nearly singular and lots of 
% partial pivoting occurs.  If the pattern of A+A' is considered to be the 
% nonzero pattern of a symmetric positive definite matrix, then nnz(L) has 
% only 3,728,967 nonzeros using p=amd(A) and chol(A(p,p)), where A excludes
% the explicit zeros in Problem.Zeros.  The flop count for the Cholesky    
% factorization is only 340.9 million.  With a pivot tolerance of 2.2e-16, 
% KLU Version 1.0 constructs and LU factorization with about 31 million    
% nonzeros, even though it uses AMD for the diagonal blocks of the BTF for 
% which the expected nnz(L) is only 3.705 million (for the Cholesky factor-
% ization of the large diagonal block).  The BTF form has little impact on 
% the factorization.                                                       
%-------------------------------------------------------------------------------
