Abstract
Wave propagation problems in unbounded homogeneous domains can be formulated as time-domain integral equations. An effective way to discretize such equations in time are Runge–Kutta based convolution quadratures. In this paper the behaviour of the weights of such quadratures is investigated. In particular approximate sparseness of their Galerkin discretization is analyzed. Further, it is demonstrated how these results can be used to construct and analyze the complexity of fast algorithms for the assembly of the fully discrete systems.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
