Cited By
View all- Miller GPhillips TSheehy D(2007)Size competitive meshing without large anglesProceedings of the 34th international conference on Automata, Languages and Programming10.5555/2394539.2394617(655-666)Online publication date: 9-Jul-2007
Estimating interpolation error: a combinatorial approach
References
[1]
I. Babu#ka and A. K. Aziz. On the angle condition in the finite element method. SINM, 13(2):214-226, 1976.
[2]
P. G. Ciarlet. The Finite Element Method for Elliptic Problems. North-Holland, 1978.
[3]
G. Golub and C. Van Loan. Matrix Computations. 3ohns Hopkins, 1990.
[4]
Steve Guattery, Tom Leighton, and Gary L. Miller. The path resistance method for bounding,#2 of a laplacian. In SODA97, pages 201-210, New Orleans, January 1997. ACM and SIAM.
[5]
F. Thomson Leighton. Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes. Morgan Kaufmann, 1992.
[6]
R. H. MacNeal. An asymmetrical finite difference network. Quarterly of Applied Math, 11:295-310, 1953.
[7]
G. L. Miller, D. Talmor, S. Teng, N. 3. Walkington, and H. Wang. Control volume meshes using sphere packing: Generation, refinement and coarsening. In 5th International Meshing Round Table, '96, pages 47--62, 1996.
[8]
Gary L. Miller and Noel J. Walkington. Bounding mixed derivatives. Manuscript, January 1998.
[9]
R. A. Nicolaides. Direct discretization of plannar div--curl problems. SINM, 29(1):32-56, February 1992.
[10]
A.3. Sinclair and M.R. Jerrum. Approximate counting uniform generation and rapidly mixing Markov chins. Inform. and Comput., 82:93-133, 1989.
Index Terms
- Estimating interpolation error: a combinatorial approach
Recommendations
Hermite Interpolation With Error Correction: Fields of Zero or Large Characteristic and Large Error Rate
ISSAC '21: Proceedings of the 2021 International Symposium on Symbolic and Algebraic ComputationMultiplicity code decoders are based on Hermite polynomial interpolation with error correction. In order to have a unique Hermite interpolant one assumes that the field of scalars has characteristic 0 or ≥ 𝓁 +1, where 𝓁 is the maximum order of the ...
Efficient error estimating coding: feasibility and applications
Motivated by recent emerging systems that can leverage partially correct packets in wireless networks, this paper proposes the novel concept of error estimating coding (EEC). Without correcting the errors in the packet, EEC enables the receiver of the ...
Efficient error estimating coding: feasibility and applications
SIGCOMM '10Motivated by recent emerging systems that can leverage partially correct packets in wireless networks, this paper investigates the novel concept of error estimating codes (EEC). Without correcting the errors in the packet, EEC enables the receiver of ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- SIAM: Society for Industrial and Applied Mathematics
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Published: 01 January 1999
Check for updates
Qualifiers
- Article
Conference
SODA99
Sponsor:
- SIGACT
- SIAM
Acceptance Rates
Overall Acceptance Rate 411 of 1,322 submissions, 31%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 43Total Downloads
- Downloads (Last 12 months)29
- Downloads (Last 6 weeks)5
Reflects downloads up to 04 Jan 2025
Other Metrics
Citations
Cited By
View all- Miller GPhillips TSheehy D(2007)Size competitive meshing without large anglesProceedings of the 34th international conference on Automata, Languages and Programming10.5555/2394539.2394617(655-666)Online publication date: 9-Jul-2007
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in