Numerische Mathematik最新文献

{"title":"A Hausdorff-measure boundary element method for acoustic scattering by fractal screens","authors":"A. M. Caetano, S. N. Chandler-Wilde, A. Gibbs, D. P. Hewett, A. Moiola","doi":"10.1007/s00211-024-01399-7","DOIUrl":"https://doi.org/10.1007/s00211-024-01399-7","url":null,"abstract":"<p>Sound-soft fractal screens can scatter acoustic waves even when they have zero surface measure. To solve such scattering problems we make what appears to be the first application of the boundary element method (BEM) where each BEM basis function is supported in a fractal set, and the integration involved in the formation of the BEM matrix is with respect to a non-integer order Hausdorff measure rather than the usual (Lebesgue) surface measure. Using recent results on function spaces on fractals, we prove convergence of the Galerkin formulation of this “Hausdorff BEM” for acoustic scattering in <span>(mathbb {R}^{n+1})</span> (<span>(n=1,2)</span>) when the scatterer, assumed to be a compact subset of <span>(mathbb {R}^ntimes {0})</span>, is a <i>d</i>-set for some <span>(din (n-1,n])</span>, so that, in particular, the scatterer has Hausdorff dimension <i>d</i>. For a class of fractals that are attractors of iterated function systems, we prove convergence rates for the Hausdorff BEM and superconvergence for smooth antilinear functionals, under certain natural regularity assumptions on the solution of the underlying boundary integral equation. We also propose numerical quadrature routines for the implementation of our Hausdorff BEM, along with a fully discrete convergence analysis, via numerical (Hausdorff measure) integration estimates and inverse estimates on fractals, estimating the discrete condition numbers. Finally, we show numerical experiments that support the sharpness of our theoretical results, and our solution regularity assumptions, including results for scattering in <span>(mathbb {R}^2)</span> by Cantor sets, and in <span>(mathbb {R}^3)</span> by Cantor dusts.\u0000</p>","PeriodicalId":49733,"journal":{"name":"Numerische Mathematik","volume":"295 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139978767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Zhang neural networks: an introduction to predictive computations for discretized time-varying matrix problems","authors":"","doi":"10.1007/s00211-023-01393-5","DOIUrl":"https://doi.org/10.1007/s00211-023-01393-5","url":null,"abstract":"<h3>Abstract</h3> <p>This paper wants to increase our understanding and computational know-how for time-varying matrix problems and Zhang Neural Networks. These neural networks were invented for time or single parameter-varying matrix problems around 2001 in China and almost all of their advances have been made in and most still come from its birthplace. Zhang Neural Network methods have become a backbone for solving discretized sensor driven time-varying matrix problems in real-time, in theory and in on-chip applications for robots, in control theory and other engineering applications in China. They have become the method of choice for many time-varying matrix problems that benefit from or require efficient, accurate and predictive real-time computations. A typical discretized Zhang Neural Network algorithm needs seven distinct steps in its initial set-up. The construction of discretized Zhang Neural Network algorithms starts from a model equation with its associated error equation and the stipulation that the error function decrease exponentially fast. The error function differential equation is then mated with a convergent look-ahead finite difference formula to create a distinctly new multi-step style solver that predicts the future state of the system reliably from current and earlier state and solution data. Matlab codes of discretized Zhang Neural Network algorithms for time varying matrix problems typically consist of one linear equations solve and one recursion of already available data per time step. This makes discretized Zhang Neural network based algorithms highly competitive with ordinary differential equation initial value analytic continuation methods for function given data that are designed to work adaptively. Discretized Zhang Neural Network methods have different characteristics and applicabilities than multi-step ordinary differential equations (ODEs) initial value solvers. These new time-varying matrix methods can solve matrix-given problems from sensor data with constant sampling gaps or from functional equations. To illustrate the adaptability of discretized Zhang Neural Networks and further the understanding of this method, this paper details the seven step set-up process for Zhang Neural Networks and twelve separate time-varying matrix models. It supplies new codes for seven of these. Open problems are mentioned as well as detailed references to recent work on discretized Zhang Neural Networks and time-varying matrix computations. Comparisons are given to standard non-predictive multi-step methods that use initial value problems ODE solvers and analytic continuation methods.</p>","PeriodicalId":49733,"journal":{"name":"Numerische Mathematik","volume":"32 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139919250","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Iterative regularization for low complexity regularizers","authors":"Cesare Molinari, Mathurin Massias, Lorenzo Rosasco, Silvia Villa","doi":"10.1007/s00211-023-01390-8","DOIUrl":"https://doi.org/10.1007/s00211-023-01390-8","url":null,"abstract":"<p>Iterative regularization exploits the implicit bias of optimization algorithms to regularize ill-posed problems. Constructing algorithms with such built-in regularization mechanisms is a classic challenge in inverse problems but also in modern machine learning, where it provides both a new perspective on algorithms analysis, and significant speed-ups compared to explicit regularization. In this work, we propose and study the first iterative regularization procedure with explicit computational steps able to handle biases described by non smooth and non strongly convex functionals, prominent in low-complexity regularization. Our approach is based on a primal-dual algorithm of which we analyze convergence and stability properties, even in the case where the original problem is unfeasible. The general results are illustrated considering the special case of sparse recovery with the <span>(ell _1)</span> penalty. Our theoretical results are complemented by experiments showing the computational benefits of our approach.</p>","PeriodicalId":49733,"journal":{"name":"Numerische Mathematik","volume":"174 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139762471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Stabilization and variations to the adaptive local iterative filtering algorithm: the fast resampled iterative filtering method","authors":"","doi":"10.1007/s00211-024-01394-y","DOIUrl":"https://doi.org/10.1007/s00211-024-01394-y","url":null,"abstract":"<h3>Abstract</h3> <p>Non-stationary signals are ubiquitous in real life. Many techniques have been proposed in the last decades which allow decomposing multi-component signals into simple oscillatory mono-components, like the groundbreaking Empirical Mode Decomposition technique and the Iterative Filtering method. When a signal contains mono-components that have rapid varying instantaneous frequencies like chirps or whistles, it becomes particularly hard for most techniques to properly factor out these components. The Adaptive Local Iterative Filtering technique has recently gained interest in many applied fields of research for being able to deal with non-stationary signals presenting amplitude and frequency modulation. In this work, we address the open question of how to guarantee a priori convergence of this technique, and propose two new algorithms. The first method, called Stable Adaptive Local Iterative Filtering, is a stabilized version of the Adaptive Local Iterative Filtering that we prove to be always convergent. The stability, however, comes at the cost of higher complexity in the calculations. The second technique, called Resampled Iterative Filtering, is a new generalization of the Iterative Filtering method. We prove that Resampled Iterative Filtering is guaranteed to converge a priori for any kind of signal. Furthermore, we show that in the discrete setting its calculations can be drastically accelerated by leveraging on the mathematical properties of the matrices involved. Finally, we present some artificial and real-life examples to show the power and performance of the proposed methods.Kindly check and confirm that the Article note is correctly identified.</p>","PeriodicalId":49733,"journal":{"name":"Numerische Mathematik","volume":"224 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-01-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139589056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Uncertainty quantification for random domains using periodic random variables","authors":"Harri Hakula, Helmut Harbrecht, Vesa Kaarnioja, Frances Y. Kuo, Ian H. Sloan","doi":"10.1007/s00211-023-01392-6","DOIUrl":"https://doi.org/10.1007/s00211-023-01392-6","url":null,"abstract":"<p>We consider uncertainty quantification for the Poisson problem subject to domain uncertainty. For the stochastic parameterization of the random domain, we use the model recently introduced by Kaarnioja et al. (SIAM J. Numer. Anal., 2020) in which a countably infinite number of independent random variables enter the random field as periodic functions. We develop lattice quasi-Monte Carlo (QMC) cubature rules for computing the expected value of the solution to the Poisson problem subject to domain uncertainty. These QMC rules can be shown to exhibit higher order cubature convergence rates permitted by the periodic setting independently of the stochastic dimension of the problem. In addition, we present a complete error analysis for the problem by taking into account the approximation errors incurred by truncating the input random field to a finite number of terms and discretizing the spatial domain using finite elements. The paper concludes with numerical experiments demonstrating the theoretical error estimates.\u0000</p>","PeriodicalId":49733,"journal":{"name":"Numerische Mathematik","volume":"1 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139465203","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Stability of the minimum energy path","authors":"Xuanyu Liu, Huajie Chen, Christoph Ortner","doi":"10.1007/s00211-023-01391-7","DOIUrl":"https://doi.org/10.1007/s00211-023-01391-7","url":null,"abstract":"<p>The minimum energy path (MEP) is the most probable transition path that connects two equilibrium states of a potential energy landscape. It has been widely used to study transition mechanisms as well as transition rates in the fields of chemistry, physics, and materials science. In this paper, we derive a novel result establishing the stability of MEPs under perturbations of the energy landscape. The result also represents a crucial step towards studying the convergence of various numerical approximations of MEPs, such as the nudged elastic band and string methods.</p>","PeriodicalId":49733,"journal":{"name":"Numerische Mathematik","volume":"75 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139413399","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Adaptive guaranteed lower eigenvalue bounds with optimal convergence rates","authors":"Carsten Carstensen, Sophie Puttkammer","doi":"10.1007/s00211-023-01382-8","DOIUrl":"https://doi.org/10.1007/s00211-023-01382-8","url":null,"abstract":"<p>Guaranteed lower Dirichlet eigenvalue bounds (GLB) can be computed for the <i>m</i>-th Laplace operator with a recently introduced extra-stabilized nonconforming Crouzeix–Raviart (<span>(m=1)</span>) or Morley (<span>(m=2)</span>) finite element eigensolver. Striking numerical evidence for the superiority of a new adaptive eigensolver motivates the convergence analysis in this paper with a proof of optimal convergence rates of the GLB towards a simple eigenvalue. The proof is based on (a generalization of) known abstract arguments entitled as the axioms of adaptivity. Beyond the known a priori convergence rates, a medius analysis is enfolded in this paper for the proof of best-approximation results. This and subordinated <span>(L^2)</span> error estimates for locally refined triangulations appear of independent interest. The analysis of optimal convergence rates of an adaptive mesh-refining algorithm is performed in 3D and highlights a new version of discrete reliability.</p>","PeriodicalId":49733,"journal":{"name":"Numerische Mathematik","volume":"16 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139053757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Improved rates for a space–time FOSLS of parabolic PDEs","authors":"Gregor Gantner, Rob Stevenson","doi":"10.1007/s00211-023-01387-3","DOIUrl":"https://doi.org/10.1007/s00211-023-01387-3","url":null,"abstract":"<p>We consider the first-order system space–time formulation of the heat equation introduced by Bochev and Gunzburger (in: Bochev and Gunzburger (eds) Applied mathematical sciences, vol 166, Springer, New York, 2009), and analyzed by Führer and Karkulik (Comput Math Appl 92:27–36, 2021) and Gantner and Stevenson (ESAIM Math Model Numer Anal 55(1):283–299 2021), with solution components <span>((u_1,textbf{u}_2)=(u,-nabla _textbf{x} u))</span>. The corresponding operator is boundedly invertible between a Hilbert space <i>U</i> and a Cartesian product of <span>(L_2)</span>-type spaces, which facilitates easy first-order system least-squares (FOSLS) discretizations. Besides <span>(L_2)</span>-norms of <span>(nabla _textbf{x} u_1)</span> and <span>(textbf{u}_2)</span>, the (graph) norm of <i>U</i> contains the <span>(L_2)</span>-norm of <span>(partial _t u_1 +{{,textrm{div},}}_textbf{x} textbf{u}_2)</span>. When applying standard finite elements w.r.t. simplicial partitions of the space–time cylinder, estimates of the approximation error w.r.t. the latter norm require higher-order smoothness of <span>(textbf{u}_2)</span>. In experiments for both uniform and adaptively refined partitions, this manifested itself in disappointingly low convergence rates for non-smooth solutions <i>u</i>. In this paper, we construct finite element spaces w.r.t. prismatic partitions. They come with a quasi-interpolant that satisfies a near commuting diagram in the sense that, apart from some harmless term, the aforementioned error depends exclusively on the smoothness of <span>(partial _t u_1 +{{,textrm{div},}}_textbf{x} textbf{u}_2)</span>, i.e., of the forcing term <span>(f=(partial _t-Delta _x)u)</span>. Numerical results show significantly improved convergence rates.</p>","PeriodicalId":49733,"journal":{"name":"Numerische Mathematik","volume":"87 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139053881","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A super-localized generalized finite element method","authors":"Philip Freese, Moritz Hauck, Tim Keil, Daniel Peterseim","doi":"10.1007/s00211-023-01386-4","DOIUrl":"https://doi.org/10.1007/s00211-023-01386-4","url":null,"abstract":"<p>This paper presents a novel multi-scale method for elliptic partial differential equations with arbitrarily rough coefficients. In the spirit of numerical homogenization, the method constructs problem-adapted ansatz spaces with uniform algebraic approximation rates. Localized basis functions with the same super-exponential localization properties as the recently proposed Super-Localized Orthogonal Decomposition enable an efficient implementation. The method’s basis stability is enforced using a partition of unity approach. A natural extension to higher order is presented, resulting in higher approximation rates and enhanced localization properties. We perform a rigorous a priori and a posteriori error analysis and confirm our theoretical findings in a series of numerical experiments. In particular, we demonstrate the method’s applicability for challenging high-contrast channeled coefficients.</p>","PeriodicalId":49733,"journal":{"name":"Numerische Mathematik","volume":"21 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138716249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Hanke–Raus rule for Landweber iteration in Banach spaces","authors":"Rommel R. Real","doi":"10.1007/s00211-023-01389-1","DOIUrl":"https://doi.org/10.1007/s00211-023-01389-1","url":null,"abstract":"<p>We consider the Landweber iteration for solving linear as well as nonlinear inverse problems in Banach spaces. Based on the discrepancy principle, we propose a heuristic parameter choice rule for choosing the regularization parameter which does not require the information on the noise level, so it is purely data-driven. According to a famous veto, convergence in the worst-case scenario cannot be expected in general. However, by imposing certain conditions on the noisy data, we establish a new convergence result which, in addition, requires neither the Gâteaux differentiability of the forward operator nor the reflexivity of the image space. Therefore, we also expand the applied range of the Landweber iteration to cover non-smooth ill-posed inverse problems and to handle the situation that the data is contaminated by various types of noise. Numerical simulations are also reported.</p>","PeriodicalId":49733,"journal":{"name":"Numerische Mathematik","volume":"72 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138744165","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}