The following pages link to Takeshi Ogita (Q291918):
Displaying 39 items.
- Simple floating-point filters for the two-dimensional orientation problem (Q291919) (← links)
- An algorithm for automatically selecting a suitable verification method for linear systems (Q633151) (← links)
- Error-free transformations of matrix multiplication by using fast routines of matrix multiplication and its applications (Q662894) (← links)
- A robust algorithm for geometric predicate by error-free determinant transformation (Q714616) (← links)
- Fast verified solutions of linear systems (Q849174) (← links)
- Adaptive and efficient algorithm for 2D orientation problem (Q849176) (← links)
- Iterative refinement for ill-conditioned linear systems (Q849192) (← links)
- Super-fast validated solution of linear systems (Q861871) (← links)
- A method of obtaining verified solutions for linear systems suited for Java (Q861896) (← links)
- Computation of sharp rigorous componentwise error bounds for the approximate solutions of systems of linear equations (Q1398048) (← links)
- Iterative refinement for symmetric eigenvalue decomposition (Q1630225) (← links)
- An a posteriori verification method for generalized real-symmetric eigenvalue problems in large-scale electronic state calculations (Q1987430) (← links)
- Generation of test matrices with specified eigenvalues using floating-point arithmetic (Q2129635) (← links)
- Convergence analysis of an algorithm for accurate inverse Cholesky factorization (Q2257609) (← links)
- Iterative refinement for singular value decomposition based on matrix multiplication (Q2293602) (← links)
- Modified error bounds for approximate solutions of dense linear systems (Q2293605) (← links)
- Performance and energy consumption of accurate and mixed-precision linear algebra kernels on GPUs (Q2297181) (← links)
- Iterative refinement for symmetric eigenvalue decomposition. II. Clustered eigenvalues (Q2318500) (← links)
- Improvement of error-free splitting for accurate matrix multiplication (Q2349545) (← links)
- Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices (Q2372948) (← links)
- Fast algorithms for floating-point interval matrix multiplication (Q2428100) (← links)
- Fast inclusion of interval matrix multiplication (Q2484077) (← links)
- Verified numerical computations for large-scale linear systems. (Q2662465) (← links)
- (Q2765620) (← links)
- Tight and efficient enclosure of matrix multiplication by using optimized BLAS (Q2889382) (← links)
- Error‐free transformation of matrix multiplication with a posteriori validation (Q2955990) (← links)
- Accurate Matrix Factorization: Inverse LU and Inverse QR Factorizations (Q3079755) (← links)
- Convergence analysis of accurate inverse Cholesky factorization (Q3121193) (← links)
- A fast and efficient algorithm for solving ill-conditioned linear systems (Q3121374) (← links)
- Accurate Floating-Point Summation Part II: Sign, <i>K</i>-Fold Faithful and Rounding to Nearest (Q3558689) (← links)
- (Q4329947) (← links)
- (Q4438141) (← links)
- Accurate Floating-Point Summation Part I: Faithful Rounding (Q5189669) (← links)
- Tight Enclosures of Solutions of Linear Systems (Q5298678) (← links)
- Computer Algebra in Scientific Computing (Q5479246) (← links)
- Accurate Sum and Dot Product (Q5693174) (← links)
- On a quality measure for interval inclusions (Q6557261) (← links)
- Verified error bounds for matrix decompositions (Q6641767) (← links)
- Extension of accurate numerical algorithms for matrix multiplication based on error-free transformation (Q6671874) (← links)
