The following pages link to Wayne Eberly (Q685710):
Displayed 26 items.
- Decompositions of algebras over \(\mathbb{R}\) and \(\mathbb{C}\) (Q685711) (← links)
- Decomposition of algebras over finite fields and number fields (Q685720) (← links)
- Fast parallel band matrix arithmetic (Q1346718) (← links)
- Efficient matrix preconditioners for black box linear algebra (Q1348088) (← links)
- Item:Q685710 (redirect page) (← links)
- Efficient decomposition of separable algebras. (Q1432890) (← links)
- Efficient decomposition of associative algebras over finite fields (Q1976671) (← links)
- Automating algorithm selection: checking for matrix properties that can simplify computations (Q2422701) (← links)
- Yet another block Lanczos algorithm (Q2946553) (← links)
- Solving sparse rational linear systems (Q2958972) (← links)
- Selecting Algorithms for Black Box Matrices (Q2985829) (← links)
- Black box Frobenius decompositions over small fields (Q3454750) (← links)
- Very Fast Parallel Polynomial Arithmetic (Q3470109) (← links)
- (Q4226959) (← links)
- (Q4227001) (← links)
- (Q4227340) (← links)
- (Q4230370) (← links)
- Logarithmic Depth Circuits for Hermite Interpolation (Q4290912) (← links)
- Reliable Krylov-based algorithms for matrix null space and rank (Q4657312) (← links)
- (Q4660651) (← links)
- Size-Depth Tradeoffs for Algebraic Formulas (Q4852620) (← links)
- (Q4886042) (← links)
- Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority (Q4924688) (← links)
- A reliable block Lanczos algorithm over small finite fields (Q5262760) (← links)
- Black box linear algebra (Q5268822) (← links)
- (Q5301663) (← links)