8 resultados para duplication inversée
em Bulgarian Digital Mathematics Library at IMI-BAS
Resumo:
Various combinatorial problems are effectively modelled in terms of (0,1) matrices. Origins are coming from n-cube geometry, hypergraph theory, inverse tomography problems, or directly from different models of application problems. Basically these problems are NP-complete. The paper considers a set of such problems and introduces approximation algorithms for their solutions applying Lagragean relaxation and related set of techniques.
Resumo:
The evaluation from experimental data, of physical quantities, which enter into the electromagnetic Maxwell equations, is described as inverse optical problem. The functional relations between the dependent and independent variables are of transcendental character and numeric procedures for evaluation of the unknowns are largely used. Herein, we discuss a direct approach to the solution, illustrated by a specific example of determination of thin films optical constants from spectrophotometric data. New algorithm is proposed for the parameters evaluation, which does not need an initial guess of the unknowns and does not use iterative procedures. Thus we overcome the intrinsic deficiency of minimization techniques, such as gradient search methods, Simplex methods, etc. The price of it is a need of more computing power, but our algorithm is easily implemented in structures such as grid clusters. We show the advantages of this approach and its potential for generalization to other inverse optical problems.
Resumo:
Mathematics Subject Classification: Primary 30C40
Resumo:
MSC 2010: 26A33, 33E12, 34K29, 34L15, 35K57, 35R30
Resumo:
2000 Mathematics Subject Classification: 42C05.
Resumo:
MSC 2010: 35J05, 33C10, 45D05
Resumo:
2000 Mathematics Subject Classification: 15A29.
Resumo:
2000 Mathematics Subject Classification: 62E16,62F15, 62H12, 62M20.