An elementary solution of a minimax problem arising in algorithms for automatic mesh selection

DOI10.1145/377626.377633zbMath1054.65084OpenAlexW2035042610MaRDI QIDQ4810175

Robert M. Corless

Publication date: 1 September 2004

Published in: ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/377626.377633

zbMATH Keywords

complexityalgorithmminimax problemautomatic mesh selection

Mathematics Subject Classification ID

Mesh generation, refinement, and adaptive methods for ordinary differential equations (65L50)

Related Items (2)

Adaptivity and computational complexity in the numerical solution of ODEs ⋮ Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time

This page was built for publication: An elementary solution of a minimax problem arising in algorithms for automatic mesh selection