Applied Numerical Mathematics最新文献

{"title":"Thermodynamics of thermoviscoelastic solids of grade 3","authors":"Vito Antonio Cimmelli","doi":"10.1016/j.apnum.2024.10.014","DOIUrl":"10.1016/j.apnum.2024.10.014","url":null,"abstract":"<div><div>A generalized Coleman-Noll procedure is applied to analyze thermoviscoelastic solids of grade 3, namely, solids with constitutive equations depending on the third spatial gradient of the deformation. Some new forms of stress tensor and specific entropy are obtained. For small deformations, the equilibrium problem is studied for onedimensional systems. An explicit form of the displacement is calculated. A comparison with the equilibrium theory of Korteweg fluids is carried out.</div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"208 ","pages":"Pages 301-313"},"PeriodicalIF":2.2,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143141565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Efficient algorithms of box-constrained Nonnegative Matrix Factorization and its applications in image clustering","authors":"Jie Guo ,&nbsp;Ting Li ,&nbsp;Zhong Wan ,&nbsp;Jiaoyan Li ,&nbsp;Yamei Xiao","doi":"10.1016/j.apnum.2024.10.015","DOIUrl":"10.1016/j.apnum.2024.10.015","url":null,"abstract":"<div><div>Nonnegative Matrix Factorization (NMF) provides an important approach of unsupervising learning, but it faces computational challenges when applied into clustering of high-dimensional datasets. In this paper, a class of novel nonmonotone gradient-descent algorithms are developed for solving box-constrained NMF problems. Unlike existing algorithms in the literature that update each matrix factor individually by fixing another one, our algorithms simultaneously update the paired matrix factors by leveraging adaptive projected Barzilai-Borwein directions and appropriate step sizes generated by the developed nonmonotone line search rules. Theoretically, it is proved that the developed algorithms are well defined and globally convergent. Extensive numerical tests on public image datasets demonstrate that the developed algorithms in this paper outperform the state-of-the-art ones, in terms of clustering performance, computational efficiency, and robustness of mining noisy data.</div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"208 ","pages":"Pages 176-188"},"PeriodicalIF":2.2,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143141226","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":"Numerical methods in modeling with supersaturated designs","authors":"N. Koukoudakis ,&nbsp;C. Koukouvinos ,&nbsp;A. Lappa ,&nbsp;M. Mitrouli ,&nbsp;A. Psitou","doi":"10.1016/j.apnum.2024.02.003","DOIUrl":"10.1016/j.apnum.2024.02.003","url":null,"abstract":"<div><div>The present study aims to investigate the application of several numerical methods<span><span> in least square problems, when the </span>design matrix<span> is a supersaturated design. This kind of statistical modeling appears frequently in a majority of applications and experiments where the main scope concerns the identification of the appropriate active factors and possible interactions as well. Several real data sets are analyzed and useful remarks and comparisons concerning the selection of the most appropriate factors are presented.</span></span></div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"208 ","pages":"Pages 271-283"},"PeriodicalIF":2.2,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139814933","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":"Numerical solutions of stochastic delay integro-differential equations by block pulse functions","authors":"Guo Jiang,&nbsp;Yuanqin Chen,&nbsp;Jiayi Ying","doi":"10.1016/j.apnum.2024.10.017","DOIUrl":"10.1016/j.apnum.2024.10.017","url":null,"abstract":"<div><div>This paper presents an efficient numerical method for solving nonlinear stochastic delay integro-differential equations based on block pulse functions. Firstly, the equation is transformed into an algebraic system by the integral delay operator matrixes of block pulse functions. Then, error analysis is conducted on the method. Finally, some numerical examples are provided to validate the method. This work provides numerical solutions for the stochastic delay integro-differential equations by global approximation method. This method has the advantages of simple calculation and higher error accuracy.</div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"208 ","pages":"Pages 214-230"},"PeriodicalIF":2.2,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143141228","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 rank-updating technique for the Kronecker canonical form of singular pencils","authors":"Dimitrios Christou ,&nbsp;Marilena Mitrouli ,&nbsp;Dimitrios Triantafyllou","doi":"10.1016/j.apnum.2024.01.015","DOIUrl":"10.1016/j.apnum.2024.01.015","url":null,"abstract":"<div><div>For a linear time-invariant system <span><math><mover><mrow><mi>x</mi></mrow><mrow><mo>˙</mo></mrow></mover><mo>(</mo><mi>t</mi><mo>)</mo><mo>=</mo><mi>A</mi><mi>x</mi><mo>(</mo><mi>t</mi><mo>)</mo><mo>+</mo><mi>B</mi><mi>u</mi><mo>(</mo><mi>t</mi><mo>)</mo></math></span><span>, the Kronecker canonical form<span> (KCF) of the matrix pencil </span></span><span><math><mo>(</mo><mi>s</mi><mi>I</mi><mo>−</mo><mi>A</mi><mspace></mspace><mo>|</mo><mspace></mspace><mi>B</mi><mo>)</mo></math></span><span> provides the controllability indices, also called column minimal indices, of the system and their sum corresponds to the dimension of the controllable subspace. In this paper we introduce a fast numerical algorithm for computing the sets of column/row minimal indices of a singular pencil </span><span><math><mi>s</mi><mi>F</mi><mo>−</mo><mi>G</mi></math></span><span> using a rank-updating technique and the properties of piecewise arithmetic progression sequences defined by the size of the null spaces of appropriate Toeplitz matrices. The method is demonstrated and tested on various data sets.</span></div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"208 ","pages":"Pages 135-145"},"PeriodicalIF":2.2,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139557855","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":"Solving the two-dimensional time-dependent Schrödinger equation using the Sinc collocation method and double exponential transformations","authors":"S. Elgharbi ,&nbsp;M. Essaouini ,&nbsp;B. Abouzaid ,&nbsp;H. Safouhi","doi":"10.1016/j.apnum.2024.04.002","DOIUrl":"10.1016/j.apnum.2024.04.002","url":null,"abstract":"<div><div>Over the last four decades, Sinc methods have occupied an important place in numerical analysis due to their simplicity and great performance. An incorporation of the Sinc collocation method with double exponential transformation is used to solve the two-dimensional time dependent Schrödinger equation. Numerical comparison between the double exponential and single exponential approaches is made to illustrate the superiority of the double exponential Sinc method.</div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"208 ","pages":"Pages 222-231"},"PeriodicalIF":2.2,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140772854","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":"Sparse approximation of complex networks","authors":"Omar De la Cruz Cabrera,&nbsp;Jiafeng Jin,&nbsp;Lothar Reichel","doi":"10.1016/j.apnum.2024.01.002","DOIUrl":"10.1016/j.apnum.2024.01.002","url":null,"abstract":"<div><div><span>This paper considers the problem of recovering a sparse approximation </span><span><math><mi>A</mi><mo>∈</mo><msup><mrow><mi>R</mi></mrow><mrow><mi>n</mi><mo>×</mo><mi>n</mi></mrow></msup></math></span><span> of an unknown (exact) adjacency matrix </span><span><math><msub><mrow><mi>A</mi></mrow><mrow><mtext>true</mtext></mrow></msub></math></span> for a network from a corrupted version of a communicability matrix <span><math><mi>C</mi><mo>=</mo><mi>exp</mi><mo>⁡</mo><mo>(</mo><msub><mrow><mi>A</mi></mrow><mrow><mtext>true</mtext></mrow></msub><mo>)</mo><mo>+</mo><mi>N</mi><mo>∈</mo><msup><mrow><mi>R</mi></mrow><mrow><mi>n</mi><mo>×</mo><mi>n</mi></mrow></msup></math></span>, where <strong>N</strong> denotes an unknown “noise matrix”. We consider two methods for determining an approximation <strong>A</strong> of <span><math><msub><mrow><mi>A</mi></mrow><mrow><mtext>true</mtext></mrow></msub></math></span>: <span><math><mo>(</mo><mrow><mi>i</mi><mo>)</mo></mrow></math></span><span> a Newton method with soft-thresholding and line search, and </span><span><math><mo>(</mo><mrow><mi>ii</mi><mo>)</mo></mrow></math></span><span> a proximal gradient method with line search. These methods are applied to compute the solution of the minimization problem</span><span><span><span><math><munder><mrow><mi>arg</mi><mo>⁡</mo><mi>min</mi></mrow><mrow><mi>A</mi><mo>∈</mo><msup><mrow><mi>R</mi></mrow><mrow><mi>n</mi><mo>×</mo><mi>n</mi></mrow></msup></mrow></munder><mo>{</mo><msubsup><mrow><mo>‖</mo><mi>exp</mi><mo>⁡</mo><mo>(</mo><mi>A</mi><mo>)</mo><mo>−</mo><mi>C</mi><mo>‖</mo></mrow><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow></msubsup><mo>+</mo><mi>μ</mi><msub><mrow><mo>‖</mo><mtext>vec</mtext><mo>(</mo><mi>A</mi><mo>)</mo><mo>‖</mo></mrow><mrow><mn>1</mn></mrow></msub><mo>}</mo><mo>,</mo></math></span></span></span> where <span><math><mi>μ</mi><mo>&gt;</mo><mn>0</mn></math></span><span> is a regularization parameter that controls the amount of shrinkage. We discuss the effect of </span><em>μ</em><span> on the computed solution, conditions for convergence, and the rate of convergence of the methods. Computed examples illustrate their performance when applied to directed and undirected networks.</span></div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"208 ","pages":"Pages 170-188"},"PeriodicalIF":2.2,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139464019","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":"Mathematical modelling of problems with delay and after-effect","authors":"Neville J. Ford","doi":"10.1016/j.apnum.2024.10.007","DOIUrl":"10.1016/j.apnum.2024.10.007","url":null,"abstract":"<div><div>This paper provides a tutorial review of the use of delay differential equations in mathematical models of real problems. We use the COVID-19 pandemic as an example to help explain our conclusions. We present the fundamental delay differential equation as a prototype for modelling problems where there is a delay or after-effect, and we reveal (via the characteristic values) the infinite dimensional nature of the equation and the presence of oscillatory solutions not seen in corresponding equations without delay. We discuss how models were constructed for the COVID-19 pandemic, particularly in view of the relative lack of understanding of the disease and the paucity of available data in the early stages, and we identify both strengths and weaknesses in the modelling predictions and how they were communicated and applied. We consider the question of whether equations with delay could have been or should have been utilised at various stages in order to make more accurate or more useful predictions.</div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"208 ","pages":"Pages 338-347"},"PeriodicalIF":2.2,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143097232","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Fast alternating fitting methods for trigonometric curves for large data sets","authors":"Alessandro Buccini ,&nbsp;Fei Chen ,&nbsp;Omar De la Cruz Cabrera ,&nbsp;Lothar Reichel","doi":"10.1016/j.apnum.2024.01.001","DOIUrl":"10.1016/j.apnum.2024.01.001","url":null,"abstract":"<div><div>This paper discusses and develops new methods for fitting trigonometric curves, such as circles, ellipses, and dumbbells, to data points in the plane. Available methods for fitting circles or ellipses are very sensitive to outliers in the data, and are time consuming when the number of data points is large. The present paper focuses on curve fitting methods that are attractive to use when the number of data points is large. We propose a direct method for fitting circles, and two iterative methods for fitting ellipses and dumbbell curves based on trigonometric polynomials. These methods efficiently minimize the sum of the squared geometric distances between the given data points and the fitted curves. In particular, we are interested in detecting the general shape of an object such as a galaxy or a nebula. Certain nebulae, for instance, the one shown in the experiment section, have a dumbbell shape. Methods for fitting dumbbell curves have not been discussed in the literature. The methods developed are not very sensitive to errors in the data points. The use of random subsampling of the data points to speed up the computations also is discussed. The techniques developed in this paper can be applied to fitting other kinds of curves as well.</div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"208 ","pages":"Pages 104-134"},"PeriodicalIF":2.2,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139464058","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Computation of pairs of related Gauss-type quadrature rules","authors":"H. Alqahtani ,&nbsp;C.F. Borges ,&nbsp;D.Lj. Djukić ,&nbsp;R.M. Mutavdžić Djukić ,&nbsp;L. Reichel ,&nbsp;M.M. Spalević","doi":"10.1016/j.apnum.2024.03.003","DOIUrl":"10.1016/j.apnum.2024.03.003","url":null,"abstract":"<div><div><span>The evaluation of Gauss-type quadrature rules is an important topic in scientific computing. To determine estimates or bounds for the quadrature error of a </span>Gauss rule often another related quadrature rule is evaluated, such as an associated Gauss-Radau or Gauss-Lobatto rule, an anti-Gauss rule, an averaged rule, an optimal averaged rule, or a Gauss-Kronrod rule when the latter exists. We discuss how pairs of a Gauss rule and a related Gauss-type quadrature rule can be computed efficiently by a divide-and-conquer method.</div></div>","PeriodicalId":8199,"journal":{"name":"Applied Numerical Mathematics","volume":"208 ","pages":"Pages 32-42"},"PeriodicalIF":2.2,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140125590","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}