Abstract
Sharp lower bounds are obtained for multiplications and storage in the sparse system arising from the application of finite difference or finite element techniques to linear boundary value problems on plane regions yielding regular $n \times n$ grids. Graph-theoretic techniques are used to take advantage of the simplicity of the underlying combinatorial structure of the problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
