Research Article10.1007/s11075-025-02067-zA new kind of block fractional generalized Adams method for solving fractional differential equationsApr 14, 2025Numerical AlgorithmsXingzhou Jiang + 2 more +2CiteListenSave
Research Article10.1007/s11075-025-02054-4H-representation method for the least squares symmetric solutions of the reduced biquaternion matrix equation and its application in color image restorationMar 21, 2025Numerical AlgorithmsSujia Han + 1 more +1CiteListenSave
Research Article10.1007/s11075-025-02046-4Decompose-then-optimize: a new approach to design domain decomposition methods for optimal control problemsMar 19, 2025Numerical AlgorithmsPierre-Henri Cocquet + 2 more +2CiteListenSave
Research Article110.1007/s11075-025-02036-6Maximal residual coordinate descent method with k-means clustering for solving large linear least-squares problemsMar 07, 2025Numerical AlgorithmsLiu Rui + 2 more +2CiteListenSave
Research Article10.1007/s11075-025-02025-9Compact finite difference schemes and error estimation for third-order Emden-Fowler equationsFeb 12, 2025Numerical AlgorithmsNirupam Sahoo + 1 more +1CiteListenSave
Research Article210.1007/s11075-025-02019-7Explicit iterative algorithm with optimal tuning parameter for stochastic Lyapunov matrix equationFeb 11, 2025Numerical AlgorithmsZebin Chen + 3 more +3CiteListenSave
Research Article110.1007/s11075-024-02003-7A robust variant of cubic smoothing spline approximationJan 09, 2025Numerical AlgorithmsMarcello De Giosa + 5 more +5We introduce a robust variant of smoothing spline regression which exploits an entropy-based argument to automatically detect and remove outliers during the fitting procedure. This involves considering a penalized weighted residual sum of squares, with the distribution of weights determined by maximizing the associated entropy function. An illustrative example is provided to show the potential of the new approach compared to other standard robust techniques. Additionally, we include examples on datasets derived from real-world applications.Read moreCiteListenSave
Research Article10.1007/s11075-024-02001-9The application of Goeken–Johnson’s Runge–Kutta methods in unconstrained convex optimizationDec 30, 2024Numerical AlgorithmsGerasim KrivovichevCiteListenSave
Research Article10.1007/s11075-024-01995-6Optimized Schwarz domain decomposition algorithms for the closest point method on closed manifoldsDec 20, 2024Numerical AlgorithmsAlireza Yazdani + 2 more +2CiteListenSave
Research Article110.1007/s11075-024-01983-wNote on two formulations of Crank-Nicolson method for Navier-Stokes equationsDec 12, 2024Numerical AlgorithmsAlexander E Labovsky + 1 more +1CiteListenSave