# 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} }

- Published 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