Computer Algebra Systems
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Subspace-selective unitary manipulation based on the Hilbert-space symmetric structures in the multiple-quantum operator algebra spaces in the quantum-computing speedup theory
Announce Type: cross Abstract: The quantum-computing speedup theory considers the symmetric structures and properties of quantum systems as the fundamental Quantum-Computing-Speedup (QCS) resources which are responsible for exponentially speeding up quantum computing and simulating. At present a large and important problem is how to make use of the fundamental QCS resources to speed up essentially quantum computing and simulating. Here the author makes a great effort toward solving this...
Subspace-selective unitary manipulation based on the Hilbert-space symmetric structures in the multiple-quantum operator algebra spaces in the quantum-computing speedup theory
arXiv:2606.03859v2 Announce Type: replace-cross Abstract: The quantum-computing speedup theory considers the symmetric structures and properties of quantum systems as the fundamental Quantum-Computing-Speedup (QCS) resources which are responsible for exponentially speeding up quantum computing and simulating. At present a large and important problem is how to make use of the fundamental QCS resources to speed up essentially quantum computing and simulating. Here the author makes a great...
Spin Correlations in Two-Particle Systems: A Pedagogically Motivated Comparison of Computational Approaches
new Abstract: In this work we present a pedagogically motivated analysis of spin-correlation calculations in a quantum system composed of two spin-$1/2$ particles. Rather than aiming at new physical results, our purpose is to clarify and bring attention to different strategies for evaluating expectation values of the form $\langle \psi | S^{(1)}_{\hat{\boldsymbol{u}}} S^{(2)}_{\hat{\boldsymbol{v}}} | \psi\rangle$, which play an important role in discussions of entanglement and Bell-type...
A Comparative Study of Deep Learning Models for Geological Carbon Sequestration
Announce Type: new Abstract: Numerical reservoir simulations are extremely computationally expensive, as they require the repeated solution of large nonlinear algebraic systems derived from the discretized governing equations. With growing demand for real-time optimization, uncertainty quantification, and history matching in digital twin applications, reducing computational cost has become essential. Deep learning (DL)--based surrogate models have emerged as an effective approach for...
Algebraic models of plane Couette equilibria
arXiv:2605.31385v1 Announce Type: new Abstract: Recent computations of weakly unstable equilibria, traveling waves, and periodic orbits in transitional shear flows suggest a spatiotemporal, dynamical-systems approach to low-Reynolds turbulence. Many invariant solutions have been computed precisely using high-dimensional direct numerical simulations, but little is known about how many solutions exist, how they are organized, or which sets of solutions best characterize the flow. In this paper...
Efficient Minimal Solvers for Relative Pose Estimation in Autonomous Driving Applications
arXiv:2606.09569v1 Announce Type: new Abstract: With the advancement of visual sensing systems, computer vision is playing an increasingly important role in autonomous driving and robot navigation. Relative pose estimation in multi-camera systems is essential for accurate vehicle localization and environment perception, demanding high real-time performance and robustness. Existing methods, however, often involve high computational costs and rely heavily on abundant feature matches, limiting...
Low-Variance Randomised Numerical Linear Algebra for Finite Element Simulation
arXiv:2606.08817v1 Announce Type: new Abstract: We present a low-variance randomised numerical linear algebra approach for multi-query finite element systems arising from parametric elliptic partial differential equations with applications to digital twins and online model calibration. The method relies on Galerkin subspace projection for reducing the dimensionality, and then combines parameter-oblivious leverage-score Bernoulli sampling with a control variates scheme to yield a...
Stochastic bifurcation analysis via polynomial chaos: consistency and convergence of branch-approximating solutions
Announce Type: new Abstract: Parameter-dependent dynamical systems that exhibit bifurcations pose significant computational challenges, as traditional continuation methods require repeated, costly simulations across large ranges of parameter values to capture sudden qualitative changes in the solution. In this work, we propose a systematic approach to reconstruct the branches of the entire bifurcation diagram in a single numerical solver leveraging generalized Polynomial Chaos (PC)...
Breaking the Simplification Bottleneck in Amortized Neural Symbolic Regression
Announce Type: replace Abstract: Symbolic regression (SR) aims to discover interpretable analytical expressions that accurately describe observed data. Amortized SR promises to be much more efficient than the predominant genetic programming SR methods, but currently struggles to scale to realistic scientific complexity. We find that a key obstacle is the lack of a fast reduction of equivalent expressions to a concise normalized form.
JAX-AMG: A GPU-Accelerated Differentiable Sparse Linear Solver Library for JAX
Announce Type: cross Abstract: Sparse linear systems from PDE discretizations are central to scientific computing, yet no existing JAX-ecosystem solver simultaneously provides GPU-accelerated algebraic multigrid (AMG), automatic differentiation (AD), and distributed multi-GPU execution. JAX-AMG fills this gap by wrapping the Nvidia AmgX solver suite as a native JAX primitive, exposing AMG and Krylov methods with configurable preconditioners through a unified interface compatible with JIT...