scispace - formally typeset
Search or ask a question

Showing papers on "Discretization published in 1972"


Journal ArticleDOI
J. C. Herz1
TL;DR: Optimal edge-to-edge cutting is shown to be achieved more easily by recursive programming than by conventional methods by way of comparison with two iterative algorithms previously given by Gilmore-Gomory.
Abstract: A recursive algorithm is implemented to give high computational speeds in the solution of a cutting-stock problem. Optimal edge-to-edge cutting is shown to be achieved more easily by recursive programming than by conventional methods. The technique features preliminary discretization, which lowers the memory requirements in the computational procedure. A comparison is made between this recursive algorithm and two iterative algorithms previously given by Gilmore-Gomory. The limitations of the algorithms are discussed and some numerical results given.

205 citations


Journal ArticleDOI
Isaac Fried1
TL;DR: With these bounds it becomes possible to study the effect of element geometry, the order of interpolation functions and other intrinsic and discretization parameters on Cn(K) and to isolate the factors that may lead to ill-conditioning.
Abstract: N a previous Note1 it has been shown (see also Refs. 2 and 3) that the spectral condition number Cn(K) of the global (stiffness) matrix K arising from a uniform mesh of finite elements (or of finite differences) discretization can be expressed by Cn(K) = cNes2m where 2m is the order of the differential equation and c a coefficient independent of Nes, the number of elements per side, but dependent on the order of the interpolation polynomials inside the element. This condition is "natural", since it is inherently associated with the approximation of the continuous problem by the discrete (algebraic) one. Nonuniform meshes of finite elements introduce many additional factors which may adversely affect the condition of the system. It is the purpose of this Note to describe a technique for establishing bounds on the condition number for irregular meshes of finite elements. With these bounds it becomes possible to study the effect of element geometry, the order of interpolation functions and other intrinsic and discretization parameters on Cn(K) and to isolate the factors that may lead to ill-conditioning. The matrix K is termed ill-conditioned when \Q~sCn(K) = 1, where s denotes the number of decimals in the computer. The bounds on Cn(K) are expressed in terms of the extremal eigenvalues of the element matrices. Since the element matrices are of restricted size, derivation of the bounds on Cn(K) as a function of the discretization parameters become straightforward for any problem and any element. Particular attention is focused on the possibility of improving the condition of the matrix by scaling. Bounds on the Extremal Eigenvalues

153 citations


Journal ArticleDOI
TL;DR: It is pointed out that the proposed algorithms are faster and more reliable than those presented in the early publications on orthogonal collocation.

70 citations


Journal ArticleDOI
Isaac Fried1
TL;DR: In this article, the spectral condition number of the stiffness and mass matrices was studied for discretization and intrinsic parametrization of fourth-and second-order field problems.

65 citations


Journal ArticleDOI
TL;DR: In this article, a simplified analog (the finite Hilbert transform) or the equation of two-dimensional incompressible thin wing flow, is studied and several important points concerning this discretization proved.

56 citations


Journal ArticleDOI
TL;DR: In this article, the problem of transient unconfined seepage under drawdown in riverbanks and dams is solved by using a finite element procedure, where an iterative procedure is employed to compute movements of the free surface caused by time wise fluctuations in the external water levels.
Abstract: The problem of transient unconfined seepage under drawdown in riverbanks and dams is solved by using a finite element procedure. An iterative procedure is employed to compute movements of the free surface caused by time wise fluctuations in the external water levels. The finite element solutions are compared with laboratory experiments on a parallel-plate viscous flow model and field observations at a section along the Mississippi River. Correlation between the numerical solutions and observations is found to be good. Consideration is given to such special requirements of numerical techniques as discretization of infinite media and various possible flow situations at discretized end boundaries. An effort is made to obtain the numerical formulations and the computer codes that yield acceptable accuracy with economy. Some projections for use of the method for design analysis are presented.

54 citations


Journal ArticleDOI
01 Jul 1972
TL;DR: In this article, a major extension of the matrix displacement method concerning the analysis of dynamic phenomena in the presence of material and geometric non-linearities is presented, in particular, elasto-plastic behaviour as well as large displacements are taken into account.
Abstract: The paper initiates a major extension of the matrix displacement method concerning the analysis of dynamic phenomena in the presence of material and geometric non-linearities. In particular, elasto-plastic behaviour as well as large displacements are taken into account. An iterative procedure of solution of the nonlinear matrix equations is discussed. The application of the theory is described in detail in two examples. The first considers the simple static problem of a rectangular flat strip in a tensile test. The iterative calculation may be carried out for deformations as large as required and shows clearly the necking effect. More ambitious is the second example which demonstrates the non-linear dynamic theory on a cyclindrial deformable billet under the impact by a heavy rigid body. The momentum of the weight and the property of the billet are such that the latter will undergo large plastic deformations. If so required, it is straightforward to incorporate damping and also allow for friction forces on the contacts. The direct applicability of the technique to forging problems is evident. The solution of the dynamic phenomenon is accomplished by extending the discretisation of space also into time. In particular, the inertia forces are taken to vary over a finite time element as a third order polynomial. Exceptional accuracy is achieved by this method.

36 citations


Journal ArticleDOI
TL;DR: In this paper, it is shown that complete simulation of turbulent flow is only feasible for two-dimensional or marginally turbulent three-dimensional flows, and it is proposed that Galerkin methods are preferred when feasible in order to avoid truncation and aliasing errors.
Abstract: Numerical simulation of turbulent flow is of practical importance in geophysics and is useful as a test of turbulence theory. From a basic scale analysis of turbulent flow it is shown that complete simulation is only practicable for two-dimensional or marginally turbulent three-dimensional flows. Some examples of such simulations are described. A more useful approach for practical applications is to directly simulate the larger scales of motion and only consider the small unresolved scales with respect to their gross statistical interactions with the larger scales. A variable eddy viscosity model has proved useful for this purpose, although better approximations can be devised. Methods of discretization and numerical integration are discussed, and it is proposed that Galerkin methods are preferred when feasible in order to avoid truncation and aliasing errors.

30 citations


Journal ArticleDOI
TL;DR: In this article, the dynamic problem of rigid plastic structures subjected to impulsive loading is discussed in matrix notation on the basis of finite element discretization of the structure and piecewise linear approximation of the yield surfaces, using some quadratic programming concepts.
Abstract: This paper discusses the dynamic problem of rigid plastic structures subjected to impulsive loading. A couple of “dual” extremum theorems reduces the problem to the optimization of convex quadratic functions subject to linear inequalities and equations: the first theorem takes as variables stress and accelerations, the second accelerations and plastic multiplier rates. The problem is discussed in matrix notation on the basis of finite element discretization of the structure and piecewise linear approximation of the yield surfaces, using some quadratic programming concepts. The procedure is illustrated by a simple numerical example.

21 citations


Journal ArticleDOI
W. Krabs1
TL;DR: In this article, a convex functional on convex subsets of a linear space subject to concave constraints is studied, and it is shown that under suitable conditions the extreme value of the functional changes continuously if the data of the given problem are changed continuously.
Abstract: In dieser Arbeit wird das Problem behandelt, ein konvexes Funktional unter konkaven Nebenbedingungen auf einer konvexen Teilmenge eines linearen Raumes zum Minimum zu machen. Es wird gezeigt, das sich der gesuchte Extremalwert des Funktionals unter geeigneten Voraussetzungen stetig andert, wenn die im Problem vorgegebenen Grosen stetig abgeandert werden. Die Ergebnisse werden angewandt auf Approximationsprobleme in normierten Raumen und Optimierungsaufgaben mit unendlich vielen Nebenbedingungen, bei denen die stetige Anderung des Problems durch Diskretisierung (Ubergang zu Halbnormen oder endlich vielen Nebenbedingungen) durchgefuhrt wird. This paper is concerned with the minimization of a convex functional on a convex subset of a linear space subject to concave constraints. It is shown that, under suitable conditions the extreme value of the functional changes continuously if the data of the given problem are changed continuously. The results will be applied to approximation problems in normed linear spaces and to optimization problems, with infinitely many constraints where the continuous change of the problem is performed by discretization (use of seminorms or restriction to finitely many constraints).

14 citations


Journal ArticleDOI
TL;DR: The linear deterministic mathematical model of a nuclear reactor system, which can be described by parabolic partial differential equations, and the problems associated with this model arc discussed in this article.
Abstract: The linear deterministic mathematical model of a nuclear reactor system, which can bo described by parabolic partial differential equations, and the problems associated with this model arc discussed in this paper. Also studied is the derivation of a maximum principle for this distributed nuclear reactor system and the problems associated with approximating this distributed system by discretization into a lumped system. Examples concerning the regulator and the servomechanism problems of a nuclear reactor system are presented.

Journal ArticleDOI
TL;DR: Equations for the smoothed state estimate and for the error covariances of a continuous-time system with multiple time delays are derived through a combination of discretization, state augmentation, and subsequent dediscretization procedures.
Abstract: Equations for the smoothed state estimate and for the error covariances of a continuous-time system with multiple time delays, based on observations involving time delays, are derived through a combination of discretization, state augmentation, and subsequent dediscretization procedures.

Journal ArticleDOI
TL;DR: In this paper, the iterative solvability of nonlinear systems of equations which arise from the discretization of Hammerstein integral equations is studied, and it is shown that, for a large class of equations satisfying monotonicity assumptions, it is possible to solve these systems by means of a linearly convergent iteration method.
Abstract: In this paper we study the iterative solvability of nonlinear systems of equations which arise from the discretization of Hammerstein integral equations. It is shown that, for a large class of equations satisfying monotonicity assumptions, it is possible to solve these systems by means of a linearly convergent iteration method. Moreover, for general monotone operators on a Hilbert space a globally convergent variant of Newton's method is given. Finally it is shown that this method effectively can be applied in a natural way to the systems of equations under consideration.

Journal ArticleDOI
TL;DR: A numerical procedure to compute the best uniform approximation to a given continuous function by algebraic polynomials with nonnegative rth derivative is presented and analyzed.
Abstract: A numerical procedure to compute the best uniform approximation to a given continuous function by algebraic polynomials with nonnegative rth derivative is presented and analyzed. The method is based on discretization and linear programming. Several numerical experiments are discussed.

01 Oct 1972
TL;DR: The theoretical derivation of a finite element solutionalgorithm for the transient energy conservation equation in multidimensional, stationary multi-mediacontinua with irregular solution domain closure establishes the complete finite element matrix forms for arbitrarily irregular discretizations using natural coordinate function representations.
Abstract: Theoretical derivation of a finite element solution algorithm for the transient energy conservation equation in multidimensional, stationary multi-media continua with irregular solution domain closure is considered. The complete finite element matrix forms for arbitrarily irregular discretizations are established, using natural coordinate function representations. The algorithm is embodied into a user-oriented computer program (COMOC) which obtains transient temperature distributions at the node points of the finite element discretization using a highly stable explicit integration procedure with automatic error control features. The finite element algorithm is shown to posses convergence with discretization for a transient sample problem. The condensed form for the specific heat element matrix is shown to be preferable to the consistent form. Computed results for diverse problems illustrate the versatility of COMOC, and easily prepared output subroutines are shown to allow quick engineering assessment of solution behavior.

Journal ArticleDOI
01 Jan 1972
TL;DR: A finite element discretization is proposed which, combined with piecewise linearization of the yield surfaces, reduces the minimum weight design to a pair of dual problems in linear mixed zero one programming.
Abstract: Limit design in three dimensions is discussed and formulated as a constrained minimax problem in kinematic and geometric variables. A finite element discretization is proposed which, combined with piecewise linearization of the yield surfaces, reduces the minimum weight design to a pair of dual problems in linear mixed zero one programming. The relevant duality theory is shown to be useful for the theoretical frame of the mechanical problem. Various ways of reducing the number of variables and constraints are pointed out, in order to make available algorithms economically applicable to practical situations.

01 Oct 1972
TL;DR: The Thermal Analysis Variant of the COMOC (computational continuum mechanics) computer system solves problems involving transient heat conduction and convection in stationary continua spanning arbitrarily irregular two-dimensional and axisymmetric solution domains.
Abstract: The Thermal Analysis Variant of the COMOC (computational continuum mechanics) computer system solves problems involving transient heat conduction and convection in stationary continua spanning arbitrarily irregular two-dimensional and axisymmetric solution domains. COMOC is based upon a finite element solution algorithm for the energy equation, and solves for the transient nodal temperature distribution using a highly stable and automatic explicit integration procedure. COMOC is extensively user-oriented, requires minimal input, and no a priori knowledge concerning the stability character of the differential equation system. It can readily output computed data in user-specified format fields, that geometrically resemble the solution domain discretization (for rapid engineering evaluation). Complete information is provided for applying COMOC to a specific problem.

01 Jul 1972
TL;DR: In this article, the latest technology for structural analysis in relation to the design tasks that lie ahead for the space shuttle is reviewed, and the analysis can be formulated as a one-dimensional problem which is readily solved by using finite-difference or numerical integration techniques.
Abstract: The latest technology for structural analysis in relation to the design tasks that lie ahead for the space shuttle is reviewed. For shell-of-revolution structures, the analysis can be formulated as a one-dimensional problem which is readily solved by using finite-difference or numerical-integration techniques. For more general asymmetric shells, a two-dimensional formulation is required. However, the governing equations are readily formulated and are amenable to solution by finite-difference techniques. For a completely general structural arrangement, such as structural frameworks, recourse is usually made to discretized formulations using finite elements. Of course, the finite-element programs could be used for shell structures, but at a loss in accuracy and increase in computer time compared with the special purpose programs.

01 May 1972
TL;DR: A DISCRETE ELEMENT ANALYSIS as discussed by the authors, which is based on an ITERATIVE PROCEDURE called the TANGENT STIFFness METHOD, is used to evaluate the performance of a general discemble.
Abstract: A DISCRETE ELEMENT ANALYSIS WHICH CONSIDERS GEOMETRIC, MATERIAL, AND SUPPORT NONLINEARITIES OF STATICALLY LOADED PLANE FRAMES IS DEVELOPED. A COMPUTER PROGRAM HAS BEEN WRITTEN TO IMPLEMENT AND VERIFY THE ANALYSIS. FRAME GEOMETRY, LOADS, CROSS SECTIONS, AND SUPPORTS (NONLINEAR CONCENTRATED AND DISTRIBUTED SPRINGS) CAN BE SUFFICIENTLY GENERAL TO WORK PRACTICAL FRAME PROBLEMS. THE METHOD OF ANALYSIS IS BASED ON AN ITERATIVE PROCEDURE CALLED THE TANGENT STIFFNESS METHOD. UNBALANCED NODAL POINT FORCES ARE APPLIED TO A TEMPORARILY LINEAR STRUCTURE WHOSE POSITION DEPENDENT STIFFNESS MATRIX IS THE TANGENT STIFFNESS MATRIX OF THE STRUCTURE. THE FRAME MEMBERS ARE DIVIDED INTO A NUMBER OF DISCRETE ELEMENTS. LOAD-DISPLACEMENT EQUATIONS FOR AN INDIVIDUAL DISCRETE ELEMENT ARE DERIVED WHICH ARE VALID FOR LARGE DISPLACEMENTS. A NUMERICAL TECHNIQUE IS USED TO DETERMINE THE FORCE-DEFORMATION RESPONSE OF A CROSS SECTION WITH NONLINEAR STRESS-STRAIN CURVES. LOADS AND NONLINEAR SUPPORTS ARE INPUT IN NORMAL ENGINEERING TERMS AND CAN BE REFERENCED EITHER TO THE STRUCTURE OR TO THE MEMBER AXES. WHEN NECESSARY, THE LOADS AND NONLINEAR SUPPORTS ARE INTERNALLY TRANSFORMED TO MEMBER COORDINTES AND DISCRETIZED TO CONCENTRATED VALUES AT THE NODAL POINTS. CASTIGLIANO'S FIRST THEOREM IS APPLIED TO DEVELOP MATRIX EXPRESSIONS FOR THE STIFFNESS MATRIX OF A GENERAL DISCRETE ELEMENT AND THESE EXPRESSIONS ARE USED TO OBTAIN THE STIFFNESS MATRIX FOR THE SPECIFIC DISCRETE ELEMENT USED IN THE FRAME SOLUTIONS. A NUMBER OF PROBLEMS ARE WORKED AND COMPARED WITH EXISTING ANALYTICAL OR EXPERIMENTAL SOLUTIONS.

Journal ArticleDOI
TL;DR: In this paper, the authors present algorithms for the synthesis and reconstruction of holograms and the results of a theoretical study of the effect the discretization step on the hologram has on the quality of the reconstructed image and synthesized holographic images of objects of complex form.
Abstract: WE present algorithms for the synthesis and reconstruction of holograms and the results of a theoretical study of the effect the discretization step on the hologram has on the quality of the reconstructed image and synthesized holographic images of objects of complex form.

01 Jan 1972
TL;DR: In this article, the Navier-Stokes equation (NSE) is solved numerically using Eulerian discretization, where at each time step, velocity and pressure variables (velocity and pressure) are computed on a xed grid of points in the plane, without taking in account the motion of the particles.
Abstract: Fluid mechanics are usually modeled after the Navier-Stokes equation (NSE). To solve it numerically, we apply an Eulerian discretization: at each time step, uid variables (velocity and pressure) are computed on a xed grid of points in the plane, without taking in account the moviment of the particles. Through a staggered grid, we avoid decoupling of pressure and velocity variables in the discretized NSE, and also improve our estimates of partial derivatives. Chorin-Temam Projection Method is used to solve NS, dividing it in two steps:

01 Aug 1972
TL;DR: An incremental theory and numerical procedure to analyze a three-dimensional thermoelastoplastic structure subjected to high temperature, surface heat flux, and volume heat supply as well as mechanical loadings are presented in this article.
Abstract: An incremental theory and numerical procedure to analyze a three-dimensional thermoelastoplastic structure subjected to high temperature, surface heat flux, and volume heat supply as well as mechanical loadings are presented. Heat conduction equations and equilibrium equations are derived by assuming a specific form of incremental free energy, entropy, stresses and heat flux together with the first and second laws of thermodynamics, von Mises yield criteria and Prandtl-Reuss flow rule. The finite element discretization using the linear isotropic three-dimensional element for the space domain and a difference operator corresponding to a linear variation of temperature within a small time increment for the time domain lead to systematic solutions of temperature distribution and displacement and stress fields. Various boundary conditions such as insulated surfaces and convection through uninsulated surface can be easily treated. To demonstrate effectiveness of the present formulation a number of example problems are presented.