Relevance and feasibility of mathematical analysis on the computer. Proceedings of a symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, March 21--22, 2000 (Q2756596)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Relevance and feasibility of mathematical analysis on the computer. Proceedings of a symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, March 21--22, 2000 |
scientific article; zbMATH DE number 1673565
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Relevance and feasibility of mathematical analysis on the computer. Proceedings of a symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, March 21--22, 2000 |
scientific article; zbMATH DE number 1673565 |
Statements
22 November 2001
0 references
Symposium
0 references
Proceedings
0 references
Kyoto (Japan)
0 references
RIMS
0 references
Mathematical analysis
0 references
Computer
0 references
Relevance and feasibility of mathematical analysis on the computer. Proceedings of a symposium held at the Research Institute for Mathematical Sciences, Kyoto University, Kyoto, Japan, March 21--22, 2000 (English)
0 references
The articles of this volume will not be indexed individually.NEWLINENEWLINENEWLINE Contents: Atsushi Yoshikawa, Why such a meeting? (1-14); Tetsuro Yamamoto, Harmonic relations between Green's functions and Green's matrices for boundary value problems (15-26); Mitsuhiro T. Nakao, Numerical verification methods for solutions of ordinary and partial differential equations (27-56); Hidefumi Ohsugi and Takayuki Hibi, The achieved role of Gröbner bases in commutative algebras (Japanese) (57-61); Vasco Brattka, Realistic models of computability on the real numbers (62-75); Hajime Ishihara, Feasibly constructive analysis (76-83); Mariko Yasugi, How to understand the computability aspects of step functions (84-91); Toshihiro Kanahori, A recognition method of matrices by combination matching of variable block pattern elements generating rectangle (Japanese) (92-96); Hirofumi Okamura, Toshihiro Kanahori and I. Sou, Handwriting interface for a computer algebra system (Japanese) (97-101); Susumu Hayashi, Formalized mathematics, proof animation, and limit computable mathematics (102-108).
0 references
0.7391178011894226
0 references