Peter Oswald
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Peter Oswald has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Michael Griebel
Institute for Numerical Simulation University of Bonn Friedrich-Hirzebruch-Allee 7 53115 Bonn Germany
7 shared publications M. Griebel
Universität Bonn, Institut für Angewandte Mathematik, Wegelerstrasse 6, D-53115 Bonn, Germany DE
4 shared publicationsMichael Griebel
4 shared publicationsTatiana Shingel
Jacobs University
3 shared publications- C. K. Madsen
Lucent Technologies
2 shared publications - Weiqi Zhou
School of Mathematics and Statistics Xuzhou University of Technology Lishui Road 2 Yunlong District 221018 Xuzhou Jiangsu Province China
2 shared publications
Latest Publications
- 14 November 2025
- Published by Springer Nature in Constructive Approximation
- Vol. 63 (2) , 447-474
Convergence Analysis of Online Algorithms for Vector-Valued Kernel Regression
- 14 November 2025
- Published by Springer Nature in Constructive Approximation
- Vol. 63 (2) , 447-474
Convergence Analysis of Online Algorithms for Vector-Valued Kernel Regression
- Open Access
- 11 August 2023
- Published by Springer Nature in Numerische Mathematik
- Vol. 154 (3-4) , 521-525
Correction: Random reordering in SOR-type methods
- 11 August 2023
- Published by Springer Nature in Numerische Mathematik
- Vol. 154 (3-4) , 521-525
Open AccessCorrection: Random reordering in SOR-type methods
- 1 June 2021
- Published by Steklov Mathematical Institute in Sbornik: Mathematics
- Vol. 212 (6) , 810-842
Multivariate Haar systems in Besov function spaces
We determine all cases for which the -dimensional Haar wavelet system on the unit cube is a conditional or unconditional Schauder basis in the classical isotropic Besov function spaces , , , defined in terms of first-order -moduli of smoothness. We obtain similar results for the tensor-product Haar system , and characterize the parameter range for which the dual of is trivial for .Bibliography: 31 titles.
- 1 June 2021
- Published by Steklov Mathematical Institute in Sbornik: Mathematics
- Vol. 212 (6) , 810-842
Multivariate Haar systems in Besov function spaces
We determine all cases for which the -dimensional Haar wavelet system on the unit cube is a conditional or unconditional Schauder basis in the classical isotropic Besov function spaces , , , defined in terms of first-order -moduli of smoothness. We obtain similar results for the tensor-product Haar system , and characterize the parameter range for which the dual of is trivial for .Bibliography: 31 titles.
- 25 May 2021
- Published by Steklov Mathematical Institute
- Vol. 212 (6) , 73-108
Многомерные системы Хаара в функциональных пространствах Бесова
Охарактеризованы все случаи, в которых система $d$-мерных всплесков Хаара $H^d$ на единичном кубе $I^d$ образует условный или безусловный базис Шаудера в классических изотропных функциональных пространствах Бесова ${B}_{p,q,1}^s(I^d)$, $0<p,q<\infty$, $0\le s < 1/p$, определяемых в терминах $L_p$-модулей гладкости первого порядка. Аналогичные результаты получены для тензорной системы Хаара $\widetilde H^d$. Охарактеризованы области параметров, для которых сопряженное пространство к ${B}_{p,q,1}^s(I^d)$ является тривиальным при $0<p<1$. Библиография: 31 название.- 25 May 2021
- Published by Steklov Mathematical Institute
- Vol. 212 (6) , 73-108
Многомерные системы Хаара в функциональных пространствах Бесова
Охарактеризованы все случаи, в которых система $d$-мерных всплесков Хаара $H^d$ на единичном кубе $I^d$ образует условный или безусловный базис Шаудера в классических изотропных функциональных пространствах Бесова ${B}_{p,q,1}^s(I^d)$, $0<p,q<\infty$, $0\le s < 1/p$, определяемых в терминах $L_p$-модулей гладкости первого порядка. Аналогичные результаты получены для тензорной системы Хаара $\widetilde H^d$. Охарактеризованы области параметров, для которых сопряженное пространство к ${B}_{p,q,1}^s(I^d)$ является тривиальным при $0<p<1$. Библиография: 31 название.- Open Access
Multivariate Haar systems in Besov function spaces
We determine all cases for which the $d$-dimensional Haar wavelet system $H^d$ on the unit cube $I^d$ is a conditional or unconditional Schauder basis in the classical isotropic Besov function spaces ${B}_{p,q,1}^s(I^d)$, $0<p,q<\infty$, $0\le s < 1/p$, defined in terms of first-order $L_p$ moduli of smoothness. We obtain similar results for the tensor-product Haar system $\tilde{H}^d$, and characterize the parameter range for which the dual of ${B}_{p,q,1}^s(I^d)$ is trivial for $0<p<1$.Open AccessMultivariate Haar systems in Besov function spaces
We determine all cases for which the $d$-dimensional Haar wavelet system $H^d$ on the unit cube $I^d$ is a conditional or unconditional Schauder basis in the classical isotropic Besov function spaces ${B}_{p,q,1}^s(I^d)$, $0<p,q<\infty$, $0\le s < 1/p$, defined in terms of first-order $L_p$ moduli of smoothness. We obtain similar results for the tensor-product Haar system $\tilde{H}^d$, and characterize the parameter range for which the dual of ${B}_{p,q,1}^s(I^d)$ is trivial for $0<p<1$. - 5 August 2019
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 89 (321) , 279-312
Stochastic subspace correction methods and fault tolerance
We present convergence results in expectation for stochastic subspace correction schemes and their accelerated versions to solve symmetric positive-definite variational problems, and discuss their potential for achieving fault tolerance in an unreliable compute network. We employ an overlapping domain decomposition algorithm for PDE discretizations to discuss the latter aspect.
- 5 August 2019
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 89 (321) , 279-312
Stochastic subspace correction methods and fault tolerance
We present convergence results in expectation for stochastic subspace correction schemes and their accelerated versions to solve symmetric positive-definite variational problems, and discuss their potential for achieving fault tolerance in an unreliable compute network. We employ an overlapping domain decomposition algorithm for PDE discretizations to discuss the latter aspect.
- 11 September 2018
- Published by Springer Nature in Constructive Approximation
- Vol. 48 (3) , 501-521
Stochastic Subspace Correction in Hilbert Space
- 11 September 2018
- Published by Springer Nature in Constructive Approximation
- Vol. 48 (3) , 501-521
Stochastic Subspace Correction in Hilbert Space
- Open Access
Stochastic subspace correction in Hilbert space
We consider an incremental approximation method for solving variational problems in infinite-dimensional Hilbert spaces, where in each step a randomly and independently selected subproblem from an infinite collection of subproblems is solved. we show that convergence rates for the expectation of the squared error can be guaranteed under weaker conditions than previously established in [Constr. Approx. 44:1 (2016), 121-139]. A connection to the theory of learning algorithms in reproducing kernel Hilbert spaces is revealed.
Open AccessStochastic subspace correction in Hilbert space
We consider an incremental approximation method for solving variational problems in infinite-dimensional Hilbert spaces, where in each step a randomly and independently selected subproblem from an infinite collection of subproblems is solved. we show that convergence rates for the expectation of the squared error can be guaranteed under weaker conditions than previously established in [Constr. Approx. 44:1 (2016), 121-139]. A connection to the theory of learning algorithms in reproducing kernel Hilbert spaces is revealed.
- Open Access
Nonconforming P1 elements on distorted triangulations: Lower bounds for the discrete energy norm error
Compared to conforming P1 finite elements, nonconforming P1 finite element discretizations are thought to be less sensitive to the appearance of distorted triangulations. E.g., optimal-order discrete $H^1$ norm best approximation error estimates for $H^2$ functions hold for arbitrary triangulations. However, similar estimates for the error of the Galerkin projection for second-order elliptic problems show a dependence on the maximum angle of all triangles in the triangulation. We demonstrate on the example of a special family of distorted triangulations that this dependence is essential, and due to the deterioration of the consistency error. We also provide examples of sequences of triangulations such that the nonconforming P1 Galerkin projections for a Poisson problem with polynomial solution do not converge or converge at arbitrarily slow speed. The results complement analogous findings for conforming P1 elements.Open AccessNonconforming P1 elements on distorted triangulations: Lower bounds for the discrete energy norm error
Compared to conforming P1 finite elements, nonconforming P1 finite element discretizations are thought to be less sensitive to the appearance of distorted triangulations. E.g., optimal-order discrete $H^1$ norm best approximation error estimates for $H^2$ functions hold for arbitrary triangulations. However, similar estimates for the error of the Galerkin projection for second-order elliptic problems show a dependence on the maximum angle of all triangles in the triangulation. We demonstrate on the example of a special family of distorted triangulations that this dependence is essential, and due to the deterioration of the consistency error. We also provide examples of sequences of triangulations such that the nonconforming P1 Galerkin projections for a Poisson problem with polynomial solution do not converge or converge at arbitrarily slow speed. The results complement analogous findings for conforming P1 elements. - Open Access
Estimates for generalized sparse grid hierarchical basis preconditioners
We reconsider some estimates the paper "M. Griebel, P. Oswald, On additive Schwarz preconditioners for sparse grid discretizations. Numer. Math. 66 (1994), 449-463" concerning the hierarchical basis preconditioner for sparse grid discretizations. The improvement is in three directions: We consider arbitrary space dimensions d>1, give bounds for generalized sparse grid spaces with arbitrary monotone index set, and show that the bounds are sharp up to constants depending only on d, at least for a subclass of generalized sparse grid spaces containing full grid, standard sparse grid spaces, and energy-norm optimized sparse grid spaces.
Open AccessEstimates for generalized sparse grid hierarchical basis preconditioners
We reconsider some estimates the paper "M. Griebel, P. Oswald, On additive Schwarz preconditioners for sparse grid discretizations. Numer. Math. 66 (1994), 449-463" concerning the hierarchical basis preconditioner for sparse grid discretizations. The improvement is in three directions: We consider arbitrary space dimensions d>1, give bounds for generalized sparse grid spaces with arbitrary monotone index set, and show that the bounds are sharp up to constants depending only on d, at least for a subclass of generalized sparse grid spaces containing full grid, standard sparse grid spaces, and energy-norm optimized sparse grid spaces.