A Domain Decomposition Algorithm Based on a Change to a Hierarchical Basis (Classic Reprint) - Tapa blanda

Sinopsis

Excerpt from A Domain Decomposition Algorithm Based on a Change to a Hierarchical Basis

The integer arrays I 1 and I2 contain pointers to the two neighbors of i which are on the next coarser level. We can regard the algorithm as defining a factored form of the matrix H. The nodal to hierarchical transformation is similar. We note that the coarse mesh needs not be uniform; see Figure 1. If the refinements are not uniform.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

"Sinopsis" puede pertenecer a otra edición de este libro.