Search results for "Quadrat"

showing 10 items of 344 documents

An Exact Algorithm for the Quadratic Assignment Problem on a Tree

1989

The Tree QAP is a special case of the Quadratic Assignment Problem (QAP) where the nonzero flows form a tree. No condition is required for the distance matrix. This problem is NP-complete and is also a generalization of the Traveling Salesman Problem. In this paper, we present a branch-and-bound algorithm for the exact solution of the Tree QAP based on an integer programming formulation of the problem. The bounds are computed using a Lagrangian relaxation of this formulation. To solve the relaxed problem, we present a Dynamic Programming algorithm which is polynomially bounded. The obtained lower bound is very sharp and equals the optimum in many cases. This fact allows us to employ a redu…

Discrete mathematicsQuadratic assignment problemManagement Science and Operations ResearchTravelling salesman problemComputer Science ApplicationsReduction (complexity)Tree (data structure)symbols.namesakeExact algorithmLagrangian relaxationsymbolsInteger programmingGeneralized assignment problemMathematicsOperations Research
researchProduct

Error-Free Affine, Unitary, and Probabilistic OBDDs

2018

We introduce the affine OBDD model and show that zero-error affine OBDDs can be exponentially narrower than bounded-error unitary and probabilistic OBDDs on certain problems. Moreover, we show that Las Vegas unitary and probabilistic OBDDs can be quadratically narrower than deterministic OBDDs. We also obtain the same results for the automata versions of these models.

Discrete mathematicsQuadratic growthLas vegas010102 general mathematicsProbabilistic logic02 engineering and technologyComputer Science::Computational ComplexityComputer Science::Artificial Intelligence01 natural sciencesUnitary stateAutomatonSuccinctnessComputer Science::Logic in Computer Science0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingAffine transformation0101 mathematicsComputer Science::DatabasesZero errorMathematics
researchProduct

Exceptional Quantum Walk Search on the Cycle

2016

Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips, staying in a uniform probability distribution for all time. We prove that the one-dimensional periodic lattice or cycle with any arrangement of marked vertices is such an exceptional configuration. Using this discovery, we construct a search problem where the quantum walk's random sampling yields an arbitrary speedup in query complexity over the classical random walk's hitting time. In this context, however, the mixing time to prepare the initial uniform state…

Discrete mathematicsQuantum PhysicsSpeedupHitting timeFOS: Physical sciencesStatistical and Nonlinear PhysicsContext (language use)Random walk01 natural sciences010305 fluids & plasmasTheoretical Computer ScienceElectronic Optical and Magnetic MaterialsQuadratic equationModeling and Simulation0103 physical sciencesSignal ProcessingSearch problemQuantum walkElectrical and Electronic Engineering010306 general physicsQuantum Physics (quant-ph)MathematicsSign (mathematics)
researchProduct

Quantum computing thanks to Bianchi groups

2018

It has been shown that the concept of a magic state (in universal quantum computing: uqc) and that of a minimal informationally complete positive operator valued measure: MIC-POVMs (in quantum measurements) are in good agreement when such a magic state is selected in the set of non-stabilizer eigenstates of permutation gates with the Pauli group acting on it [1]. Further work observed that most found low-dimensional MICs may be built from subgroups of the modular group PS L(2, Z) [2] and that this can be understood from the picture of the trefoil knot and related 3-manifolds [3]. Here one concentrates on Bianchi groups PS L(2, O10) (with O10 the integer ring over the imaginary quadratic fie…

Discrete mathematics[SPI.ACOU]Engineering Sciences [physics]/Acoustics [physics.class-ph]010308 nuclear & particles physicsPhysicsQC1-999010103 numerical & computational mathematics01 natural sciencesRing of integers[SPI.MAT]Engineering Sciences [physics]/MaterialsModular group0103 physical sciencesPauli groupQuadratic field0101 mathematics[SPI.NANO]Engineering Sciences [physics]/Micro and nanotechnologies/MicroelectronicsQuantumEigenvalues and eigenvectorsTrefoil knotQuantum computerMathematics
researchProduct

High-fidelity analysis of multilayered shells with cut-outs via the discontinuous Galerkin method

2021

Abstract A novel numerical method for the analysis of multilayered shells with cut-outs is presented. In the proposed approach, the shell geometry is represented via either analytical functions or NURBS parametrizations , while generally-shaped cut-outs are defined implicitly within the shell modelling domain via a level set function . The multilayered shell problem is addressed via the Equivalent-Single-Layer approach whereby high-order polynomial functions are employed to approximate the covariant components of the displacement field throughout the shell thickness. The shell governing equations are then derived from the Principle of Virtual Displacements of three-dimensional elasticity an…

DiscretizationNumerical analysisMathematical analysisShell (structure)Finite element methodQuadrature (mathematics)Discontinuous Galerkin methodDisplacement fieldCeramics and CompositesCut-outs High-order modeling Implicit mesh Interior Penalty discontinuous Galerkin Multilayered shells NURBSSettore ING-IND/04 - Costruzioni E Strutture AerospazialiCivil and Structural EngineeringAnalytic functionMathematicsComposite Structures
researchProduct

Tabu search with strategic oscillation for the quadratic minimum spanning tree

2014

The quadratic minimum spanning tree problem consists of determining a spanning tree that minimizes the sum of costs of the edges and pairs of edges in the tree. Many algorithms and methods have been proposed for this hard combinatorial problem, including several highly sophisticated metaheuristics. This article presents a simple Tabu Search (TS) for this problem that incorporates Strategic Oscillation (SO) by alternating between constructive and destructive phases. The commonalties shared by this strategy and the more recently introduced methodology called iterated greedy search are shown and implications of their differences regarding the use of memory structures are identified. Extensive …

Distributed minimum spanning treeTree (data structure)Mathematical optimizationQuadratic equationSpanning treeEuclidean minimum spanning treeMinimum spanning treeMetaheuristicIndustrial and Manufacturing EngineeringTabu searchMathematicsIIE Transactions
researchProduct

Influence of the quadratic term in the alongwind stochastic response of SDOF structures

1996

A parametric study, regarding the influence of the quadratic pressure term, which is often neglected in the literature, on the stochastic alongwind response of a single-degree-of-freedom (SDOF) structure subjected to wind action, is presented. The results are reported in terms of percentages of difference in the evaluation of the response, by considering and neglecting the quadratic pressure term. The changing parameters considered are: the terrain drag coefficient, the structure height, the structure natural radian frequency, the structure damping coefficient and the wind reference mean velocity. The response stochastic analysis has been carried out in the time domain, by means of the mome…

Drag coefficientStochastic processMathematical analysisSDOF structureWind engineeringWind speedTerm (time)Quadratic equationControl theoryTime domainAlongwind stochastic responseCivil and Structural EngineeringMathematicsParametric statisticsEngineering Structures
researchProduct

Monotonically convergent optimal control theory of quantum systems under a nonlinear interaction with the control field

2008

We consider the optimal control of quantum systems interacting non-linearly with an electromagnetic field. We propose new monotonically convergent algorithms to solve the optimal equations. The monotonic behavior of the algorithm is ensured by a non-standard choice of the cost which is not quadratic in the field. These algorithms can be constructed for pure and mixed-state quantum systems. The efficiency of the method is shown numerically on molecular orientation with a non-linearity of order 3 in the field. Discretizing the amplitude and the phase of the Fourier transform of the optimal field, we show that the optimal solution can be well-approximated by pulses that could be implemented ex…

Electromagnetic fieldPhysicsQuantum opticsQuantum Physics[ PHYS.QPHY ] Physics [physics]/Quantum Physics [quant-ph]Field (physics)FOS: Physical sciencesMonotonic function[ MATH.MATH-NA ] Mathematics [math]/Numerical Analysis [math.NA][MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA]Linear-quadratic-Gaussian controlOptimal control01 natural sciencesAtomic and Molecular Physics and Optics010305 fluids & plasmasNonlinear system[PHYS.QPHY]Physics [physics]/Quantum Physics [quant-ph]0103 physical sciencesApplied mathematicsQuantum algorithmQuantum Physics (quant-ph)010306 general physics[PHYS.QPHY] Physics [physics]/Quantum Physics [quant-ph][MATH.MATH-NA]Mathematics [math]/Numerical Analysis [math.NA]ComputingMilieux_MISCELLANEOUSPhysical Review A
researchProduct

Model predictive control for drum water level of boiler systems

2014

EngineeringDrum Water LevelInformation Systems and Managementbusiness.industryBoiler (power generation)DrumLinear-quadratic-Gaussian controlWater levelNonlinear systemModel predictive controlControl theoryControl and Systems EngineeringbusinessNon-linear SystemsDrum Water Level; Model Predictive Control; Non-linear Systems; Information Systems and Management; Control and Systems EngineeringModel Predictive Control
researchProduct

Robust Predictive Control of a variable speed wind turbine using the LMI formalism

2014

This paper proposes a Robust Fuzzy Multivariable Model Predictive Controller (RFMMPC) using Linear Matrix Inequalities (LMIs) formulation. The main idea is to solve at each time instant, an LMI optimization problem that incorporates input, output and Constrained Receding Horizon Predictive Control (CRHPC) constraints, and plant uncertainties, and guarantees certain robustness properties. The RFMMPC is easily designed by solving a convex optimization problem subject to LMI conditions. Then, the derived RFMMPC applied to a variable wind turbine with blade pitch and generator torque as two control inputs. The effectiveness of the proposed design is shown by simulation results.

EngineeringMathematical optimizationOptimization problembusiness.industryBlade pitchLMIs formalism; predictive control; quadratic program; T-S fuzzy model; Control and Systems EngineeringFuzzy logicVariable speed wind turbineModel predictive controlLMIs formalismControl and Systems EngineeringComputer Science::Systems and ControlControl theoryRobustness (computer science)Convex optimizationQuadratic programmingquadratic programT-S fuzzy modelbusinesspredictive control2014 European Control Conference (ECC)
researchProduct