Results 31 to 40 of about 852,005 (184)
Journal of Applied Mathematics, 2013 An iterative algorithm is proposed for solving the least-squares problem of a general matrix equation ∑i=1tMiZiNi=F, where Zi (i=1,2,…,t) are to be determined centro-symmetric matrices with given central principal submatrices.
Li-fang Dai +2 more
doaj +1 more source
Stochastic Estimation of MIMO Detection Error Caused by Low-Bitwidth QR Decomposition
IEEE Open Journal of the Communications SocietyIn this paper, we propose a new approach to justify a roundoff error impact on the accuracy of the linear least squares (LS) solution using QR decomposition.
Alexander Osinsky +4 more
doaj +1 more source
Iterative Solution to a System of Matrix Equations
Abstract and Applied Analysis, 2013 An efficient iterative algorithm is presented to solve a system of linear matrix equations , with real matrices and . By this iterative algorithm, the solvability of the system can be determined automatically.
Yong Lin, Qing-Wen Wang
doaj +1 more source
Cycles and circles in roundoff errors
Physical Review E, 1993 CYCLER Paper 93feb007 ascii with figures available from ...
openaire +3 more sources
A Certified Lower Bounds of Roundoff Errors using Semidefinite Programming
, 2017 A longstanding problem related to floating-point implementation of numerical programs is to provide efficient yet precise analysis of output errors.
Magron, Victor, Farid, Mountassir
core +2 more sources
A Splitting Architecture for Exact Reduced Coulomb Friction
Computer Graphics Forum, EarlyView.Abstract Existing approaches to frictional contact dynamics typically either modify the Coulomb law to improve numerical robustness or solve the exact law in a fully coupled monolithic form. However, in its reduced form, exact Coulomb friction can be written as a cone complementarity problem with an augmented velocity, which reveals a natural split ...
Hongcheng Song +3 more
wiley +1 more source
Proceedings in Applied Mathematics and Mechanics, Volume 26, Issue 4, December 2026.ABSTRACT Stochastic Galerkin methods offer unexplored potential for the numerical simulation of parabolic problems with random variables, in particular if they are combined with variational discretizations of the space and time variables. Due to the high dimensionality, the solution of the arising algebraic systems do not become feasible without ...
Moataz Dawor +2 more
wiley +1 more source
Compile‐Once Block Encodings for Masked Similarity‐Transformed Effective Hamiltonians
Advanced Quantum Technologies, Volume 9, Issue 9, September 2026.Composer transforms structured electronic‐structure operators into a reusable quantum‐circuit fabric. Once compiled, the same block‐encoding architecture is re‐dialed through coefficients, rotation angles, and masks to generate similarity‐transformed effective Hamiltonians across related problem instances, avoiding repeated structural recompilation ...
Bo Peng, Yuan Liu, Karol Kowalski
wiley +1 more source
Artificial Intelligence for Engineering, Volume 2, Issue 3, Page 251-264, September 2026.Caputo‐based fPINNs accurately solve fractional ODEs and PDEs while exposing an accuracy–cost trade‐off driven by the history‐dependent fractional derivative. Temporal collocation and shorter time windows are the most effective strategies for improving early‐time accuracy without unnecessary spatial refinement.
Donya Dabiri +4 more
wiley +1 more source
Bidiagonal Decompositions and High‐Accuracy Computations for Newton Collocation Matrices
Numerical Linear Algebra with Applications, Volume 33, Issue 4, August 2026.ABSTRACT We consider a class of collocation matrices A$$ A $$ associated with the Newton basis of the space of polynomials of degree at most n$$ n $$, evaluated at a set of l+1≥n+1$$ l+1\ge n+1 $$ nodes. In the most general setting, we allow n$$ n $$ of these nodes to either coincide with or differ from those defining the Newton basis.
E. Mainar, A. Marco, B. Rubio, R. Viaña
wiley +1 more source