In this paper we establish approximation preserving reductions between scheduling problems in which jobs either consume some raw materials, or produce some intermediate products, and variants of the knapsack problem. Through the reductions, we get new approximation algorithms, as well as inapproximability results for the scheduling problems. [ABSTRACT FROM AUTHOR]
*ARBITRARY constants, *FINITE element method, *APPROXIMATION theory, *ALGORITHMS, *MATHEMATICAL analysis
Abstract
Abstract: In this paper we discuss constrained approximation with arbitrary-level hanging nodes in adaptive higher-order finite element methods ( -FEM) for three-dimensional problems. This technique enables using highly irregular meshes, and it greatly simplifies the design of adaptive algorithms as it prevents refinements from propagating recursively through the finite element mesh. The technique makes it possible to design efficient adaptive algorithms for purely hexahedral meshes. We present a detailed mathematical description of the method and illustrate it with numerical examples. [Copyright &y& Elsevier]
Abstract: Let and be nontrivial involutions, i.e., and . A matrix is called -symmetric if . This paper presents a -symmetric matrix solution to the inverse eigenproblem with a leading principal submatrix constraint. The solvability condition of the constrained inverse eigenproblem is also derived. The existence, the uniqueness and the expression of the -symmetric matrix solution to the best approximation problem of the constrained inverse eigenproblem are achieved, respectively. An algorithm is presented to compute the -symmetric matrix solution to the best approximation problem. Two numerical examples are given to illustrate the effectiveness of our results. [Copyright &y& Elsevier]