Publications Details
A best approximation evaluation of a finite element calculation
We discuss an electrostatics problem whose solution must lie in the set script capital L sign of all real n-by-n symmetric matrices with all row sums equal to zero. With respect to the Frobenius norm, we provide an algorithm that finds the member of script capital L sign which is closest to any given n-by-n matrix, and determines the distance between the two. This algorithm makes it practical to find the distances to script capital L sign of finite element approximate solutions of the electrostatics problem, and to reject those which are not sufficiently close. © 1999 Elsevier Science Inc. All rights reserved.