Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.


Contents of Volume 71, Number 237
HTML articles powered by AMS MathViewer
View front and back matter from the print issue

Mixed finite element methods for unilateral problems: convergence analysis and numerical studies
Patrice Coorevits, Patrick Hild, Khalid Lhalouani and Taoufik Sassi PDF
Math. Comp. 71 (2002), 1-25
Projection method III: Spatial discretization on the staggered grid
Weinan E and Jian-Guo Liu PDF
Math. Comp. 71 (2002), 27-47
A posteriori error estimates for general numerical methods for Hamilton-Jacobi equations. Part I: The steady state case
Samuel Albert, Bernardo Cockburn, Donald A. French and Todd E. Peterson PDF
Math. Comp. 71 (2002), 49-76
Convergence of an iterative algorithm for solving Hamilton-Jacobi type equations
Jerry Markman and I. Norman Katz PDF
Math. Comp. 71 (2002), 77-103
Global and uniform convergence of subspace correction methods for some convex optimization problems
Xue-Cheng Tai and Jinchao Xu PDF
Math. Comp. 71 (2002), 105-124
Backward Euler discretization of fully nonlinear parabolic problems
C. González, A. Ostermann, C. Palencia and M. Thalhammer PDF
Math. Comp. 71 (2002), 125-145
On the stability of the $L^2$ projection in $H^1(\Omega )$
James H. Bramble, Joseph E. Pasciak and Olaf Steinbach PDF
Math. Comp. 71 (2002), 147-156
Merging the Bramble-Pasciak-Steinbach and the Crouzeix-Thomée criterion for $H^1$-stability of the $L^2$-projection onto finite element spaces
Carsten Carstensen PDF
Math. Comp. 71 (2002), 157-163
Quincunx fundamental refinable functions and quincunx biorthogonal wavelets
Bin Han and Rong-Qing Jia PDF
Math. Comp. 71 (2002), 165-196
A geometric theory for preconditioned inverse iteration applied to a subspace
Klaus Neymeyr PDF
Math. Comp. 71 (2002), 197-216
Accurate computation of the smallest eigenvalue of a diagonally dominant $M$-matrix
Attahiru Sule Alfa, Jungong Xue and Qiang Ye PDF
Math. Comp. 71 (2002), 217-236
Newton-like method with modification of the right-hand-side vector
Nataša Krejić and Zorana Lužanin PDF
Math. Comp. 71 (2002), 237-250
Directional Newton methods in $n$ variables
Yuri Levin and Adi Ben-Israel PDF
Math. Comp. 71 (2002), 251-262
Component-by-component construction of good lattice rules
I. H. Sloan and A. V. Reztsov PDF
Math. Comp. 71 (2002), 263-273
Centered $L_2$-discrepancy of random sampling and Latin hypercube design, and construction of uniform designs
Kai-Tai Fang, Chang-Xing Ma and Peter Winker PDF
Math. Comp. 71 (2002), 275-296
Asymptotic properties of the spectral test, diaphony, and related quantities
Hannes Leeb PDF
Math. Comp. 71 (2002), 297-309
Automatic reduction of elliptic integrals using Carlson’s relations
Norman Gray PDF
Math. Comp. 71 (2002), 311-318
Proving the deterministic period breaking of linear congruential generators using two tile quasicrystals
Louis-Sébastien Guimond and Jiří Patera PDF
Math. Comp. 71 (2002), 319-332
Security of the most significant bits of the Shamir message passing scheme
Maria Isabel González Vasco and Igor E. Shparlinski PDF
Math. Comp. 71 (2002), 333-342
Computation of several cyclotomic Swan subgroups
Timothy Kohl and Daniel R. Replogle PDF
Math. Comp. 71 (2002), 343-348
Lie symmetries and differential Galois groups of linear equations
W. R. Oudshoorn and M. van der Put PDF
Math. Comp. 71 (2002), 349-361
Special prime numbers and discrete logs in finite prime fields
Igor A. Semaev PDF
Math. Comp. 71 (2002), 363-377
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
D. R. Stinson PDF
Math. Comp. 71 (2002), 379-391
Arithmetic on superelliptic curves
S. D. Galbraith, S. M. Paulus and N. P. Smart PDF
Math. Comp. 71 (2002), 393-405
Sparse squares of polynomials
John Abbott PDF
Math. Comp. 71 (2002), 407-413
Upper bounds for the prime divisors of Wendt’s determinant
Anastasios Simalarides PDF
Math. Comp. 71 (2002), 415-427
On the resolution of relative Thue equations
István Gaál and Michael Pohst PDF
Math. Comp. 71 (2002), 429-440
On the primality of $n! \pm 1$ and $2 \times 3 \times 5 \times \dotsm \times p \pm 1$
Chris K. Caldwell and Yves Gallot PDF
Math. Comp. 71 (2002), 441-448
Fifteen consecutive integers with exactly four prime factors
Tony Forbes PDF
Math. Comp. 71 (2002), 449-452
Corrigendum to “Spherical Marcinkiewicz-Zygmund inequalities and positive quadrature”
H. N. Mhaskar, F. J. Narcowich and J. D. Ward PDF
Math. Comp. 71 (2002), 453-454