Results 11 to 20 of about 12,622,425 (302)

Radiosity and relaxation methods [PDF]

open access: yesIEEE Computer Graphics and Applications, 1994
To date, there has been some confusion in the computer graphics community about how the progressive radiosity (PR) method relates to standard numerical methods for solving linear systems of equations. We show that PR is actually equivalent to the combination of two numerical analysis techniques known as Southwell relaxation and Jacobi iteration.
Steven J. Gortler   +2 more
exaly   +3 more sources

Revisiting lagrange relaxation (LR) for processing large-scale mixed integer programming (MIP) problems [PDF]

open access: yes, 2004
Lagrangean Relaxation has been successfully applied to process many well known instances of NP-hard Mixed Integer Programming problems. In this paper we present a Lagrangean Relaxation based generic solver for processing Mixed Integer Programming ...
Siamitros, C, Mitra, G, Poojari, CA
core   +5 more sources

Relaxation methods for optimal control problems [PDF]

open access: yesBulletin of Mathematical Sciences, 2020
We consider a nonlinear optimal control problem with dynamics described by a differential inclusion involving a maximal monotone map A : ℝN → 2ℝN. We do not assume that D(A) = ℝN, incorporating in this way systems with unilateral constraints in our ...
Nikolaos S. Papageorgiou   +2 more
doaj   +1 more source

Study of the Complex Permittivity of a Polyurethane Matrix Modified by Nanoparticles

open access: yesIEEE Access, 2021
This study presents the influence of various types of nanoparticle (NP) fillers incorporated into a polyurethane (PU) (VUKOL 022) matrix and its subsequent changes in complex permittivity.
Jozef Kudelcik   +6 more
doaj   +1 more source

Analysis of Polarization and Depolarization Currents of Samples of NOMEX®910 Cellulose–Aramid Insulation Impregnated with Synthetic Ester

open access: yesEnergies, 2022
The paper presents the results of laboratory tests regarding the impact of accelerated thermal ageing of cellulose–aramid insulation samples saturated with electrical-insulating synthetic ester on the polarization and depolarization current ...
Adam Krotowski, Stefan Wolny
doaj   +1 more source

Analysis of Polarization and Depolarization Currents of Samples of NOMEX®910 Cellulose–Aramid Insulation Impregnated with Mineral Oil

open access: yesEnergies, 2020
The article presents results of laboratory tests performed on samples of NOMEX®910 cellulose–aramid insulation impregnated with Nynas Nytro 10× inhibited insulating mineral oil using the polarization and depolarization current analysis method (PDC Method)
Stefan Wolny, Adam Krotowski
doaj   +1 more source

Problem Relaxation Methods for Quantum Minimum Fill-in Algorithm

open access: yesIEEE Access, 2023
Current quantum annealing and quantum-inspired annealing devices have many usage limitations and are difficult to apply to real-scale problems. In particular, a major hardware limitation is the limited number of available variables (qubits).
Tomoko Komiyama, Tomohiro Suzuki
doaj   +1 more source

Boundedness Theorems for the Relaxation Method [PDF]

open access: yesMathematics of Operations Research, 2005
A classical theorem by Block and Levin (Block, H. D., S. A. Levin. 1970. On the boundedness of an iterative procedure for solving a system of linear inequalities. Proc. Amer. Math. Soc. 26 229–235) states that certain variants of the relaxation method for solving systems of linear inequalities generate bounded sequences of intermediate solutions, even
AMALDI, EDOARDO, R. Hauser
openaire   +1 more source

The mathematical model of quantum dots pair orientation under laser radiation field

open access: yesКомпьютерная оптика, 2022
One approach for the formation of structures with complex geometries at the nanoscale is the step-by-step assembly. In this case, it is necessary to be able to estimate the time required to establish orientational equilibrium for a preformed pair of ...
V.S. Petrakova   +2 more
doaj   +1 more source

Relaxation Methods for Linear Programs [PDF]

open access: yesMathematics of Operations Research, 1987
In this paper we propose a new method for solving linear programs. This method may be viewed as a generalized coordinate descent method whereby the descent directions are chosen from a finite set. The generation of the descent directions are based on results from monotropic programming theory.
Paul Tseng, Dimitri P. Bertsekas
openaire   +3 more sources

Home - About - Disclaimer - Privacy