


default search action
Mathematics of Computation, Volume 95
Volume 95, Number 357, 2025
- Lorenzo Botti, Michele Botti, Daniele A. Di Pietro, Francesco Carlo Massa:

Stability, convergence, and pressure-robustness of numerical schemes for incompressible flows with hybrid velocity and pressure. 1-28 - Jessika Camaño, Ricardo Oyarzúa, Miguel Serón

, Manuel E. Solano:
A conforming finite element method for a nonisothermal fluid-membrane interaction. 29-72 - Yao Cheng, Xuesong Wang, Martin Stynes:

Optimal balanced-norm error estimate of the LDG method for reaction-diffusion problems II: The two-dimensional case with layer-upwind flux. 73-103 - Yannis Voet

, Espen Sande
, Annalisa Buffa:
Mass lumping and outlier removal strategies for complex geometries in isogeometric analysis. 105-146 - Jan Giesselmann, Sam G. Krupa:

Theory of shifts, shocks, and the intimate connections to L2-type A posteriori error analysis of numerical schemes for hyperbolic problems. 147-225 - Thiago Carvalho Corso

, Gaspard Kemlin
, Christof Melcher, Benjamin Stamm:
Numerical simulation of the Gross-Pitaevskii equation via vortex tracking. 227-262 - Changtao Sheng, Bihao Su, Chenglong Xu

:
An implicit-explicit Monte Carlo method for semi-linear PDEs driven by α-stable Lévy process and its error estimates. 263-291 - Nicola Guglielmi, Arturo De Marinis, Anton Savostianov, Francesco Tudisco:

Contractivity of neural ODEs: An eigenvalue optimization problem. 293-319 - Salah Eddargani

, Carla Manni, Hendrik Speleers:
Quadrature rules for splines of high smoothness on uniformly refined triangles. 321-338 - Takashi Goda:

A randomized lattice rule without component-by-component construction. 339-361 - Alessandro Languasco

, Pieter Moree:
Euler constants from primes in arithmetic progression. 363-387 - Qiao-Long Huang, Xiao-Shan Gao:

Bit complexity of polynomial GCD on sparse representation. 389-413 - Xavier Caruso, Antoine Leudière:

Algorithms for computing norms and characteristic polynomials on general Drinfeld modules. 415-455 - Marc Masdeu

, Xavier Xarles:
Efficient computation of non-archimedean theta functions. 457-475 - Sandra Di Rocco, Lukas Gustafsson, Luca Sodomaco:

Conditional Euclidean distance optimization via relative tangency. 477-524

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














