TR-2011002 : Symbolic Lifting for Structured Linear Systems of Equations : Numerical Initialization , Nearly Optimal Boolean Cost , Variations , and Extensions

@inproceedings{Pan2010TR2011002S,
  title={TR-2011002 : Symbolic Lifting for Structured Linear Systems of Equations : Numerical Initialization , Nearly Optimal Boolean Cost , Variations , and Extensions},
  author={Victor Y. Pan},
  year={2010}
}
Hensel’s symbolic lifting for a linear system of equations and numerical iterative refinement of its solution have striking similarity. Combining the power of lifting and refinement seems to be a natural resource for further advances, but turns out to be hard to exploit. In this paper, however, we employ iterative refinement to initialize lifting. In the case of Toeplitz, Hankel, and other popular structured inputs our hybrid algorithm supports Boolean (bit operation) time bound that is optimal… CONTINUE READING
0 Citations
39 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 39 references

Unified Nearly Optimal Algorithms for Structured Integer Matrices, in Numerical Methods for Structured Matrices and Applications: Georg Heinig memorial volume, Operator Theory

  • V. Y. Pan, B. Murphy, R. E. Rosholt
  • Advances and Applications,
  • 2010

Degeneration of Integer Matrices Modulo an Integer

  • V. Y. Pan, X. Wang
  • Linear Algebra and Its Application,
  • 2008

Similar Papers

Loading similar papers…