{"title":"General double-relaxation two-sweep modulus-based matrix splitting iteration methods for horizontal linear complementarity problem","authors":"Dan Wang, Jicheng Li","doi":"10.1007/s11075-024-01860-6","DOIUrl":"https://doi.org/10.1007/s11075-024-01860-6","url":null,"abstract":"<p>For solving horizontal linear complementarity problem (HLCP), we propose a general double-relaxation two-sweep modulus-based matrix splitting iteration method and a double-relaxation two-sweep modulus-based matrix splitting iteration method which contain a series of methods, by using different splittings. When the system matrices are <span>(H_+)</span>-matrices, we analyze convergence theory of these methods. Numerical examples in this paper illustrate that these methods are more efficient than modulus-based matrix splitting iteration method and general modulus-based matrix splitting iteration method.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141514534","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Spectral characterizations and integer powers of tridiagonal 2-Toeplitz matrices","authors":"Maryam Shams Solary, Stefano Serra-Capizzano","doi":"10.1007/s11075-024-01863-3","DOIUrl":"https://doi.org/10.1007/s11075-024-01863-3","url":null,"abstract":"<p>In this note, we consider real nonsymmetric tridiagonal 2-Toeplitz matrices <span>(textbf{B}_n)</span>. First we give the asymptotic spectral and singular value distribution of the whole matrix-sequence <span>({textbf{B}_n}_n)</span>, which is described via two eigenvalue functions of a <span>(2times 2)</span> matrix-valued symbol. In connection with the above findings, we provide a characterization of the eigenvalues and eigenvectors of real tridiagonal 2-Toeplitz matrices <span>(textbf{B}_n)</span> of even order, that can be turned into a numerical effective scheme for the computation of all the entries of <span>(textbf{B}_n^l)</span>, <i>n</i> even and <i>l</i> positive and small compared to <i>n</i>. We recall that a corresponding eigenvalue decomposition for odd order tridiagonal 2-Toeplitz matrices was found previously, while, for even orders, an implicit formula for all the eigenvalues is obtained.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141508313","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Convergence analysis of Picard–SP iteration process for generalized $$alpha $$ –nonexpansive mappings","authors":"Bashir Nawaz, Kifayat Ullah, Krzysztof Gdawiec","doi":"10.1007/s11075-024-01859-z","DOIUrl":"https://doi.org/10.1007/s11075-024-01859-z","url":null,"abstract":"<p>In this manuscript, we introduce a novel hybrid iteration process called the Picard–SP iteration process. We apply this new iteration process to approximate fixed points of generalized <span>(alpha )</span>–nonexpansive mappings. Convergence analysis of our newly proposed iteration process is discussed in the setting of uniformly convex Banach spaces and results are correlated with some other existing iteration processes. The dominance of the newly proposed iteration process is exhibited with the help of a new numerical example. In the end, the comparison of polynomiographs generated by other well-known iteration processes with our proposed iteration process has been presented to make a strong impression of our proposed iteration process.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141508310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"$$L^2$$ norm convergence of IMEX BDF2 scheme with variable-step for the incompressible Navier-Stokes equations","authors":"Bingquan Ji, Xuan Zhao","doi":"10.1007/s11075-024-01858-0","DOIUrl":"https://doi.org/10.1007/s11075-024-01858-0","url":null,"abstract":"<p>We present an <span>(L^2)</span> norm convergence of the implicit-explicit BDF2 scheme with variable-step for the unsteady incompressible Navier-Stokes equations with an inf-sup stable FEM for the space discretization. Under a weak step-ratio constraint <span>(0<r_k:=tau _k/tau _{k-1}<4.864)</span>, our error estimate is mesh-robust in the sense that it completely removes the possibly unbounded quantities, such as <span>(Gamma _N=sum _{k=1}^{N-2}max {0,r_{k}-r_{k+2}})</span> and <span>(Lambda _N=sum _{k=1}^{N-1}(|r_{k}-1|+|r_{k+1}-1|))</span> included in previous studies. In this analysis, we integrate our recent theoretical framework that employs discrete orthogonal convolution (DOC) kernels with an auxiliary Stokes problem to split the convergence analysis into two distinct parts. In the first part, we address intricate consistency error estimates for the velocity, pressure and nonlinear convection term. The resulting estimates allow us to utilize the conventional methodologies within the DOC framework to preserve spatial accuracy. In the second part, through the use of the DOC technique, we prove that the proposed variable-step BDF2 scheme is of second-order accuracy in time with respect to the <span>(L^2)</span> norm. Extensive numerical simulations coupled with an adaptive time-stepping algorithm are performed to show the accuracy and efficiency of the proposed variable-step method for the incompressible flows.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141514530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Solving a system of complex matrix equations using a gradient-based method and its application in image restoration","authors":"Akbar Shirilord, Mehdi Dehghan","doi":"10.1007/s11075-024-01856-2","DOIUrl":"https://doi.org/10.1007/s11075-024-01856-2","url":null,"abstract":"","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141336735","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On certain matrix algebras related to quasi-Toeplitz matrices","authors":"Dario A. Bini, Beatrice Meini","doi":"10.1007/s11075-024-01855-3","DOIUrl":"https://doi.org/10.1007/s11075-024-01855-3","url":null,"abstract":"<p>Let <span>(A_alpha )</span> be the semi-infinite tridiagonal matrix having subdiagonal and superdiagonal unit entries, <span>((A_alpha )_{11}=alpha )</span>, where <span>(alpha in mathbb C)</span>, and zero elsewhere. A basis <span>({P_0,P_1,P_2,ldots })</span> of the linear space <span>(mathcal {P}_alpha )</span> spanned by the powers of <span>(A_alpha )</span> is determined, where <span>(P_0=I)</span>, <span>(P_n=T_n+H_n)</span>, <span>(T_n)</span> is the symmetric Toeplitz matrix having ones in the <i>n</i>th super- and sub-diagonal, zeros elsewhere, and <span>(H_n)</span> is the Hankel matrix with first row <span>([theta alpha ^{n-2}, theta alpha ^{n-3}, ldots , theta , alpha , 0, ldots ])</span>, where <span>(theta =alpha ^2-1)</span>. The set <span>(mathcal {P}_alpha )</span> is an algebra, and for <span>(alpha in {-1,0,1})</span>, <span>(H_n)</span> has only one nonzero anti-diagonal. This fact is exploited to provide a better representation of symmetric quasi-Toeplitz matrices <span>(mathcal{Q}mathcal{T}_S)</span>, where, instead of representing a generic matrix <span>(Ain mathcal{Q}mathcal{T}_S)</span> as <span>(A=T+K)</span>, where <i>T</i> is Toeplitz and <i>K</i> is compact, it is represented as <span>(A=P+H)</span>, where <span>(Pin mathcal {P}_alpha )</span> and <i>H</i> is compact. It is shown experimentally that the matrix arithmetic obtained this way is much more effective than that implemented in the toolbox <span>CQT-Toolbox</span> of <i>Numer. Algo.</i> 81(2):741–769, 2019.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141514531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Two-level methods for solving higher order finite element discretizations of nonsymmetric and indefinite elliptic problem","authors":"Liuqiang Zhong, Huilan Li, Ming Tang","doi":"10.1007/s11075-024-01857-1","DOIUrl":"https://doi.org/10.1007/s11075-024-01857-1","url":null,"abstract":"","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141369261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On solving 2D weakly singular Volterra integral equations of the second kind","authors":"Y. Chakir, H. Safouhi","doi":"10.1007/s11075-024-01854-4","DOIUrl":"https://doi.org/10.1007/s11075-024-01854-4","url":null,"abstract":"","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141375778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Numerical solutions of the EW and MEW equations using a fourth-order improvised B-spline collocation method","authors":"Guangyu Fan, Beibei Wu","doi":"10.1007/s11075-024-01853-5","DOIUrl":"https://doi.org/10.1007/s11075-024-01853-5","url":null,"abstract":"<p>A fourth-order improvised cubic B-spline collocation method (ICSCM) is proposed to numerically solve the equal width (EW) equation and the modified equal width (MEW) equation. The discretization of the spatial domain is done using the ICSCM and the Crank-Nicolson scheme is used for the discretization of the temporal domain. The nonlinear terms are processed using quasi-linearization techniques and the stability analysis of this method is performed using Fourier series analysis. The validity and accuracy of this method are verified through several numerical experiments using a single solitary wave, two solitary waves, Maxwellian initial condition, and an undular bore. Since there is an exact solution for the single wave, the error norms <span>(varvec{L_2})</span> and <span>(varvec{L_{infty }})</span> are first calculated and compared with some previous studies published in journal articles. In addition, the three conserved quantities <span>(varvec{Q})</span>, <span>(varvec{M})</span>, and <span>(varvec{E})</span> of the problems raised during the simulation are also calculated and recorded in the table. Lastly, the comparisons of these error norms and conserved quantities show that the numerical results obtained with the proposed method are more accurate and agree well with the values of the conserved quantities obtained in some literatures using the same parameters. The main advantage of ICSCM is its ability to effectively capture solitary wave propagation and describe solitary wave collisions. It can perform solution calculations at any point in the domain, easily use larger time steps to calculate solutions at higher time levels, and produce more accurate calculation results.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141252794","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Modified projection method and strong convergence theorem for solving variational inequality problems with non-Lipschitz operators","authors":"Zhongbing Xie, Huanqin Wu, Liya Liu","doi":"10.1007/s11075-024-01851-7","DOIUrl":"https://doi.org/10.1007/s11075-024-01851-7","url":null,"abstract":"<p>In this paper, we introduce a modified projection method and give a strong convergence theorem for solving variational inequality problems in real Hilbert spaces. Under mild assumptions, there exists a novel line-search rule that makes the proposed algorithm suitable for non-Lipschitz continuous and pseudo-monotone operators. Compared with other known algorithms in numerical experiments, it is shown that our algorithm has better numerical performance.</p>","PeriodicalId":54709,"journal":{"name":"Numerical Algorithms","volume":null,"pages":null},"PeriodicalIF":2.1,"publicationDate":"2024-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141191380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}