Strikwerda, John C. Initial boundary value problems for incompletely parabolic systems. (English) Zbl 0351.35051 Commun. Pure Appl. Math. 30, 797-822 (1977). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 37 Documents MSC: 35K45 Initial value problems for second-order parabolic systems 35M99 Partial differential equations of mixed type and mixed-type systems of partial differential equations 35A05 General existence and uniqueness theorems (PDE) (MSC2000) PDFBibTeX XMLCite \textit{J. C. Strikwerda}, Commun. Pure Appl. Math. 30, 797--822 (1977; Zbl 0351.35051) Full Text: DOI References: [1] Agranovich, Funct. Anal. Appl. 6 pp 85– (1972) [2] Belov, Math. Notes Acad. Sci. 10 pp 480– (1971) [3] Hersh, J. Math. Mech. 12 pp 317– (1963) [4] Perturbation Theory for Linear Operators, Springer-Verlag, New York, 1966. [5] Kreiss, Comm. Pure Appl. Math. 22 pp 277– (1970) [6] Kreiss, Math. Scand. 13 pp 109– (1963) · Zbl 0145.13303 · doi:10.7146/math.scand.a-10694 [7] Lions, ICC Bull. 5 pp 1– (1966) [8] Majda, Comm. Pure Appl. Math. 28 pp 607– (1975) [9] Nirenberg, Proc. Symp. Pure Math. 16 pp 149– (1970) · doi:10.1090/pspum/016/0270217 [10] Novik, USSR Comput. Math., Phys. 9 pp 122– (1969) [11] Ralston, Comm. Pure Appl. Math. 24 pp 759– (1971) [12] Difference Methods for Initial Value Problems, Interscience, New York, 1957. [13] Taniguchi, Publ. Res. Inst. Math. Sci., Kyoto Univ. 8 pp 471– (1972) [14] Initial boundary value problems for incompletely parabolic systems, Ph.D. thesis, Stanford University, 1976. [15] Pseudo Differential Operators, Lecture Notes in Mathematics, No. 416, Springer-Verlag, New York, 1974. · doi:10.1007/BFb0101246 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.