Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “problem”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,657 records · Page 92

Some Problems in Density Functional Theory

Though calculations based on density functional theory (DFT) are used remarkably widely in chemistry, physics, materials science, and biomolecular research and though the modern form of DFT has been studied for almost 60 years, some mathematical problems remain. From a physical science perspective, it is far from clear whether those problems are of major import. For context, we provide an outline of the basic structure of DFT as it is presented and used conventionally in physical sciences, note some unresolved mathematical difficulties with those conventional demonstrations, then pose several questions regarding both the time-independent and time-dependent forms of DFT that could benefit from attention in applied mathematics. Furthermore, progress on any of these would aid in development of better approximate functionals and in interpretation of DFT.

36 MATERIALS SCIENCE↗

Solving security constrained optimal power flow problems by a structure exploiting interior point method

In this paper we present a new approach to solve the DC (n - 1) security constrained optimal power flow (SCOPF) problem by a structure exploiting interior point solver. Our approach is based on a reformulation of the linearised SCOPF model, in which most matrices that need to be factorized are constant. Hence, most factorizations and a large number of back-solve operations only need to be performed once. However, assembling the Schur complement matrix remains expensive in this scheme. To reduce the effort, we suggest using a preconditioned iterative method to solve the corresponding linear system. We suggest two main schemes to pick a good and robust preconditioner based on combining different “active” contingency scenarios of the SCOPF model. These new schemes are implemented within the object-oriented parallel solver (OOPS), a structure-exploiting primal-dual interior-point implementation. We give results on several SCOPF test problems. The largest example contains 500 buses. We compare the results from the original interior point method (IPM) implementation in OOPS and our new reformulation.

30 DIRECT ENERGY CONVERSION↗

The method of transition boundary for the solution of diffraction problems

A new method, which enables one to solve some diffraction problems, is put forth. The technique is based on a relation between the diffracted and scattered geometric optics waves at the transition boundaries. The concept of initial waves is also used instead of the incident field. The general algorithm of the method is outlined and applied to the diffraction problems of waves by perfect electric conductor half-screen, resistive half-plane and impedance sheet junction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-fidelity Uncertainty Quantification for Homogenization Problems in Structure-Property Relationships from Crystal Plasticity Finite Elements

Crystal plasticity finite element method (CPFEM) has been an integrated computational materials engineering (ICME) workhorse to study materials behaviors and structure-property relationships for the last few decades. These relations are mappings from the microstructure space to the materials properties space. Due to the stochastic and random nature of microstructures, there is always some uncertainty associated with materials properties, for example, in homogenized stress-strain curves. For critical applications with strong reliability needs, it is often desirable to quantify the microstructure-induced uncertainty in the context of structure-property relationships. However, this uncertainty quantification (UQ) problem often incurs a large computational cost because many statistically equivalent representative volume elements (SERVEs) are needed. In this article, we apply a multi-level Monte Carlo (MLMC) method to CPFEM to study the uncertainty in stress-strain curves, given an ensemble of SERVEs at multiple mesh resolutions. By using the information at coarse meshes, we show that it is possible to approximate the response at fine meshes with a much reduced computational cost. We focus on problems where the model output is multi-dimensional, which requires us to track multiple quantities of interest (QoIs) at the same time. In conclusion, our numerical results show that MLMC can accelerate UQ tasks around 2.23x, compared to the classical Monte Carlo (MC) method, which is widely known as ensemble average in the CPFEM literature.

36 MATERIALS SCIENCE↗

Least-squares solutions of generalized inverse eigenvalue problem over Hermitian–Hamiltonian matrices with a submatrix constraint

In this paper, a gradient-based iterative algorithm is proposed for finding the least-squares solutions of the following constrained generalized inverse eigenvalue problem: given X∈C{sup n×m}, Λ=diag(λ{sub 1},λ{sub 2},…,λ{sub m})∈C{sup m×m}, find A{sup ∗},B{sup ∗}∈C{sup n×n}, such that ∥AX−BXΛ∥ is minimized, where A{sup ∗},B{sup ∗} are Hermitian–Hamiltonian except for a special submatrix. For any initial constrained matrices, a solution pair (A{sup ∗},B{sup ∗}) can be obtained in finite iteration steps by this iterative algorithm in the absence of roundoff errors. The least-norm solution can be obtained by choosing a special kind of initial matrix pencil. In addition, the unique optimal approximation solution to a given matrix pencil in the solution set of the above problem can also be obtained. A numerical example is given to show the efficiency of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Exact and heuristic algorithms for minimizing Tardy/Lost penalties on a single-machine scheduling problem

This paper addresses minimizing Tardy/Lost penalties with common due dates on a single machine. According to this penalty criterion, if tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. The problem is formulated as an integer programming model, and a heuristic algorithm is constructed. Then, using the proposed dominance rules and lower bounds, we develop two dynamic programming algorithms as well as a branch and bound. Experimental results show that the heuristic algorithm has an average optimality gap less than 2 % in all problem sizes. Instances up to 250 jobs with low variety of process times are optimally solved and for high process time varieties, the algorithms solved all instances up to 75 jobs.

97 MATHEMATICS AND COMPUTING↗

The generalized Uzawa-SHSS method for non-Hermitian saddle-point problems

Recently, Li and Wu (2015) proposed the single-step Hermitian and skew-Hermitian splitting (SHSS) method for solving the non-Hermitian positive definite linear systems. Based on the single-step Hermitian and skew-Hermitian splitting of the (1,1) part of the saddle-point coefficient matrix, a new Uzawa-type method is proposed for solving a class of saddle-point problems with non-Hermitian positive definite (1,1) parts. Convergence (Semi-convergence) properties of this new method for nonsingular (singular) are derived under suitable conditions. Numerical examples are implemented to confirm the theoretical results and verify that this new method is more feasibility and robustness than the new HSS-like (NHSS-like), the Uzawa-HSS and the parameterized Uzawa-skew-Hermitian triangular splitting (PU-STS) methods for solving both the nonsingular and the singular saddle-point problems with non-Hermitian positive definite and Hermitian dominant (1,1) parts.

97 MATHEMATICS AND COMPUTING↗

An approach based on dwindling filter method for positive definite generalized eigenvalue problem

In this paper, we present a new spectral residual method for solving large-scale positive definite generalized eigenvalue problems. The proposed algorithm is equipped with a dwindling multidimensional nonmonotone filter, in which the envelope dwindles as the step length decreases. We have also employed a relaxed nonmonotone line search technique in the structure of the algorithm which allows it to enjoy the nonmonotonicity from scratch. Under some mild and standard assumptions, the global convergence property of the proposed algorithm is established. An implementation of the new algorithm on some test problems shows the efficiency and effectiveness of the proposed algorithm in practice.

97 MATHEMATICS AND COMPUTING↗

A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment

This paper presents a new variant of periodic vehicle routing problem in which the reaching time to the customers affects market share. Thus, there is a competition between distributors to achieve more market share by reaching the customers earlier than others; moreover, travel time between each two pairs of customers is uncertain. This situation is called an uncertain competitive environment. For the given problem, a new bi-objective mathematical model including minimization of total traveled time and maximization of the market share is presented. In order to solve this model, a multi-objective particle swarm (MOPSO) and local MOPSO algorithms are applied; and to evaluate the algorithm performance, some samples are generated; and the results of algorithms are compared based on some comparison metrics. The results demonstrate that the proposed LMOPSO algorithm leads to a better performance compared to the MOPSO in most comparison metrics.

97 MATHEMATICS AND COMPUTING↗

Geometric and algebraic structures associated with the channel quantization problem

We consider the use of surfaces as topological spaces in order to provide an answer to the quantization problem of a discrete memoryless channel (DMC). The aim is to identify the geometric and algebraic properties of the surface associated with the embedding of such a DMC. The procedure is based on the following steps: knowing the complete bipartite graph associated with a given DMC: (1) to determine the minimum and the maximum genus of the corresponding surfaces in which the given graph is embedded; (2) knowing the genus, to specify the roots as the elements of a Farey sequence of a planar algebraic curve; (3) to determine the solutions of a second-order Fuchsian differential equation as the generators of the corresponding Fuchsian group. We consider the cases of the hypergeometric and Heun equations, with three and four regular singular points, respectively. By means of this procedure, the fundamental region associated with the Fuchsian group is identified and this is the region where the planar algebraic curve is uniformized. A generalization of the quantization problem related to an m-ary input n-ary output symmetric channel viewed as a complete bipartite graph K{sub m,n}, by use of the embedding of this channel in compact surfaces is straightforward.

97 MATHEMATICS AND COMPUTING↗

An active-set algorithm and a trust-region approach in constrained minimax problem

In this paper, we propose an algorithm to solve a finite minimax problem with side constraints. An active-set strategy is used in the algorithm to transform inequality constraints to equality constraints. This allows the use of the well-developed techniques for solving the equality constrained optimization problems. A trust-region globalization strategy is added to the proposed algorithm to ensure global convergence. A projected Hessian technique is used in the algorithm to overcome the difficulty of having an infeasible trust-region subproblem.A global convergence theory for the proposed algorithm is presented under standard assumptions. Finally, numerical experiments are reported to indicate that the new algorithm performs efficiently in practice.

97 MATHEMATICS AND COMPUTING↗

The generalized double shift-splitting preconditioner for nonsymmetric generalized saddle point problems from the steady Navier–Stokes equations

In this paper, a generalized double shift-splitting (GDSS) preconditioner induced by a newmatrix splitting method is proposed and implemented for nonsymmetric generalized saddle point problems having a nonsymmetric positive definite (1,1)-block and a positive definite (2,2)-block. Detailed theoretical analysis of the iteration matrix is provided to show the GDSS method, which corresponds to the GDSS preconditioner, is unconditionally convergent. Additionally,a deteriorated GDSS (DGDSS) method is proposed. It is shown that, with suitable choice of parameter matrix, the DGDSS preconditioned matrix has an eigenvalue at 1 with multiplicity n,and the other m eigenvalues are of the form1−λwith|λ| < 1,independently of the Schur complement matrix related. Finally, numerical experiments arising from a model Navier–Stokes problem are provided to validate and illustrate the effectiveness of the proposed preconditioner, with which a faster convergence for Krylov subspace iteration methods can be achieved.

42 ENGINEERING↗

GSTS-Uzawa method for a class of complex singular saddle point problems

In this paper, we propose GSTS–Uzawa method for solving a class of complex singular saddle point problems based on generalized skew-Hermitian triangular splitting (GSTS) iteration method and classical Uzawa method. We research on its semi-convergence properties and the eigenvalues distributions of its preconditioned matrix. The resulting GSTS–Uzawa preconditioner is used to precondition Krylov subspace methods such as the restarted generalized minimal residual (GMRES) method for solving the equivalent formulation of the complex singular saddle point problems. The theoretical results and effectiveness of the GSTS–Uzawa method are supported by a numerical example.

97 MATHEMATICS AND COMPUTING↗

An overlapping domain decomposition method for large-scale problems

Discretization of dynamical models defined through partial differential equations leads to large-scale systems. Time-depending condition involves an iterative integration of such kind of systems. In this paper, a novel technique based on overlapped domain decomposition, without preconditioner and scalable, is presented. Due to the domain decomposition, subproblems are solved in parallel without communications, cutting off the computation time and optimizing the computational cost. This direct method describes an optimized parallel strategy to solve the initial problem, providing the exact solution, up to rounding errors. Moreover, it takes into account both physical nature of the problem and deriving numerical properties of the system. It is highly recommended in case of band matrices and a long time interval because of an increasing gain in terms of performance and computational cost with the number of integrations. A deep analysis of the computational cost concludes the paper.

97 MATHEMATICS AND COMPUTING↗

Boundary coefficient determination for an eddy current problem based on the potential field method

We study a recovery problem for an unknown boundary coefficient relating to one material characteristic in an eddy current field. The field equations are represented in terms of the potential field method (T-ψ method) and can be solved numerically by the nodal finite element method. We introduce a measurement as an additional condition and prove the existence and uniqueness of the weak solution. Further, we present an iteration algorithm for the recovery problem and validate its efficiency by two numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Bi-objective approaches for home healthcare medical team planning and scheduling problem

In this paper, we study the medical team planning and scheduling in home healthcare within a weekly horizon, including the planning of nursing visits and the daily traveling route scheduling. Two objectives are considered: the first one is to minimize the total operation cost of the healthcare agency and the second one is to maximize the patient satisfaction. The problem is formulated as a mixed integer program, to seek for a trade-off between two objectives, with the characteristics of the patient requirements including nursing types, nursing frequency and service length considered. Medical team types, available service days and overwork penalty are also respected in the model. Then an ϵ-constraint method is adopted to obtain exact non-dominated solutions. To address large-scale problem instances, three heuristic approaches are developed to generate approximate Pareto fronts in a reasonable time. The set of non-dominated solutions are valuable for decision-making. Computational experiments are conducted and the results demonstrate the efficiency of the approaches.

97 MATHEMATICS AND COMPUTING↗

A new Uzawa method for fourth-order block saddle point problems

In this paper, we first propose a new Uzawa-SOR method for fourth-order block saddle point problems. Then we study its convergence conditions through some lemmas and theorems. Finally, the numerical results are presented to prove the 4-USOR method we proposed has less workload per iteration and higher accuracy for large linear system than the other Uzawa-type methods for solving the fourth-order block saddle point problem, which shows the effectiveness and feasibility of our method.

97 MATHEMATICS AND COMPUTING↗

Discrete Hahn polynomials for numerical solution of two-dimensional variable-order fractional Rayleigh–Stokes problem

The main aim of this paper is to find the numerical solutions of 2D Rayleigh–Stokes problem with the variable-order fractional derivatives in the Riemann–Liouville sense. The presented method is based on collocation procedure in combination with the new operational matrix of the variable-order fractional derivatives, in the Caputo sense, for the discrete Hahn polynomials. The main advantage of the proposed method is obtaining a global approximation for spatial and temporal discretizations, and it reduced the problem to an algebraic system, which is easier to solve. Also, the profit of approximating a continuous function by Hahn polynomials is that for computing the coefficients of the expansion, we only have to compute a summation and the calculation of coefficients is exact. The error bound for the approximate solution is estimated. Finally, we evaluate results of the presented method with other numerical methods.

97 MATHEMATICS AND COMPUTING↗