Sökning: "Problem formulation"

Visar resultat 6 - 10 av 409 avhandlingar innehållade orden Problem formulation.

  1. 6. Constitutive models based on dislocation density : formulation and implementation into finite element codes

    Författare :Konstantin Domkin; Luleå tekniska universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Datorstödd maskinkonstruktion; Computer Aided Design;

    Sammanfattning : Correct description of the material behaviour is an extra challenge in simulation of the materials processing and manufacturing processes such as metal forming. Material models must account for varying strain, strain rate and temperature, and changing microstructure. LÄS MER

  3. 7. Numerical algorithms for nonlinear eigenproblems with eigenvector nonlinearities

    Författare :Parikshit Upadhyaya; Elias Jarlebring; Robert Corless; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; numerical algorithms; nonlinear eigenproblems; multiparameter eigenvalue problem; nonlinear eigenvalue problem; eigenvector nonlinearities; nepv; scf; p-laplacian; quasi-newton; Numerical Analysis; Numerisk analys;

    Sammanfattning : Eigenproblems and their nonlinear generalizations appear as important problems in a wide variety of fields, ranging from quantum chemistry and vibration analysis to macroeconomics and data science. Hence, the development and analysis of numerical algorithms to solve such problems has a broad multiplicative effect on our ability to answer several crucial scientific questions. LÄS MER

  4. 8. On the Faddeev-type formulation of the three- and N-body problem in quantum mechanics

    Författare :Bengt R. Karlsson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : .... LÄS MER

  5. 9. Decomposition schemes for the traveling salesman subtour problem

    Författare :Andreas Westerlund; Athanasios Migdalas; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : Given an undirected graph with edge costs and both revenues and weights on the vertices, the Traveling Salesman Subtour Problem is to find a subtour that passes a depot vertex, satisfies a knapsack constraint on the vertex weights, and that minimizes edge costs minus vertex revenues along the subtour. This problem generalizes the Traveling Salesman Problem and is therefore -hard. LÄS MER

  7. 10. Applying quantum approximate optimization to the heterogeneous vehicle routing problem

    Författare :David Fitzek; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; combinatorial optimization; variational quantum algorithm; Quantum computing; quantum approximate optimization algorithm; vehicle routing;

    Sammanfattning : Quantum computing offers new heuristics for combinatorial problems. With small- and intermediate-scale quantum devices becoming available, it is possible to implement and test these heuristics on small-size problems. LÄS MER