Reginald P. Tewarson

According to our database1, Reginald P. Tewarson authored at least 22 papers between 1966 and 1989.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1989
Three-dimensional capacitance computations for VLSI/ULSI interconnections.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1989

1984
A quasi-Newton method with sparse triple factorization for unconstrained minimization.
Computing, 1984

1979
A unified derivation of quasi-Newton methods for solving non-sparse and sparse nonlinear equations.
Computing, 1979

1975
An iterative method for solving partitioned linear equations.
Computing, 1975

1974
Generalized inverses and resolution in the solution of linear equations.
Computing, 1974

1973
A desirable form for sparse matrices when computing their inverse in factored forms.
Computing, 1973

1972
Solution of linear equations in remote sensing and picture reconstruction.
Computing, 1972

On the gaussian elimination method for inverting sparse matrices.
Computing, 1972

On the optimal choice of pivots for the Gaussian elimination.
Computing, 1972

On the fill-in when sparse vectors are orthonormalized.
Computing, 1972

On minimax solutions of linear equations.
Comput. J., 1972

1971
On two direct methods for computing generalized inverses.
Computing, 1971

1970
On the use of generalized inverses in function minimization.
Computing, 1970

Minimax solution of n+1 inconsistent linear equations in n unknowns.
Computing, 1970

1969
On computing generalized inverses.
Computing, 1969

A least squares iterative method for singular equations.
Comput. J., 1969

The Crout reduction for sparse matrices.
Comput. J., 1969

Projection Methods for Solving Sparse Linear Systems.
Comput. J., 1969

1968
On the orthonormalization of sparse vectors.
Computing, 1968

A Computational Method for Evaluating Generalized Inversesyy.
Comput. J., 1968

1967
Row-column permutation of sparse matrices.
Comput. J., 1967

1966
On comparison of the algorithms for linear programming.
Commun. ACM, 1966


  Loading...