Implement high-precision conjugate gradient solver for improved WebGPU performance

[Copilot]

This PR addresses the precision issues in the WebGPU implementation by introducing a comprehensive linear system solver framework with a high-precision conjugate gradient method.

Problem

The existing solver implementation lacked precision for conjugate gradient operations, particularly affecting WebGPU-accelerated computations in finite element analysis scenarios.

Solution

Implemented a centralized linear system solver architecture with multiple high-precision algorithms:

Key Components Added

1. Centralized Linear System Solver (linearSystemSolverScript.js)

• Unified interface supporting lusolve, jacobi, and cg/conjugate methods
• Consistent error handling and performance logging
• Easy extensibility for future solver implementations

2. High-Precision Conjugate Gradient Solver (conjugateGradientSolverScript.js)

• Optimized for symmetric positive definite systems common in FEA
• Uses native Float64 arithmetic for maximum precision
• Implements classical CG algorithm with proper convergence checking
• Significantly faster convergence compared to iterative methods like Jacobi

3. Enhanced Jacobi Solver (jacobiSolverScript.js)

• Clean JavaScript implementation replacing complex async Taichi.js wrapper
• Maintains interface consistency with other solvers
• Improved numerical stability through better iteration management

4. Helper Utilities (helperFunctionsScript.js)

• Euclidean norm calculation for convergence testing
• System size calculation utilities
• Foundation for future numerical operations

Integration Improvements

• Updated FEAScript.js to use the new centralized solver system
• Modified newtonRaphsonScript.js to leverage improved linear system solving
• Enhanced build configuration with mathjs dependency for mathematical operations

Performance Benefits

The conjugate gradient implementation provides superior precision through:

• Faster Convergence: CG typically converges in O(√κ) iterations vs O(κ) for Jacobi, where κ is the condition number
• Theoretical Optimality: CG is provably optimal for symmetric positive definite systems
• Reduced Error Accumulation: Fewer iterations mean less floating-point error accumulation
• Better Numerical Stability: Superior handling of ill-conditioned matrices

Testing

• ✅ Build system integration verified
• ✅ All solver methods properly integrated with FEAScriptModel
• ✅ Backward compatibility maintained for existing code
• ✅ Support for both "cg" and "conjugate" method names

Example Usage

const model = new FEAScriptModel('solidHeatTransfer', meshConfig, boundaryConditions);
model.setSolverMethod('cg'); // Use conjugate gradient for faster, more precise solving
const result = model.solve();

This implementation provides a solid foundation for high-precision numerical computations in WebGPU-accelerated finite element analysis while maintaining full backward compatibility with existing solver methods.

---

💬 Share your feedback on Copilot coding agent for the chance to win a $200 gift card! Click here to start the survey.