In the current article we propose a new efficient, reliable and breakdown-free algorithm for solving general opposite-bordered tridiagonal linear systems. An explicit formula for computing the ...
You can create a release to package software, along with release notes and links to binary files, for other people to use. Learn more about releases in our docs.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community. Issues are used to track todos, bugs, feature requests, and more.
Abstract: In order to accelerate the subset computation of eigenpairs for real symmetric tridiagonal matrices on shared-memory multi-core processors, a parallel symmetric tridiagonal eigensolver is ...
ABSTRACT: In the current article we propose a new efficient, reliable and breakdown-free algorithm for solving general opposite-bordered tridiagonal linear systems. An explicit formula for computing ...
Abstract: The solution of tridiagonal linear systems is used in in various fields and plays a crucial role in numerical simulations. However, there is few efficient solver for tridiagonal linear ...
Recently Laurie presented a new algorithm for the computation of (2n + 1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. This algorithm first determines a symmetric ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback