نتایج جستجو برای: logarithmic method

تعداد نتایج: 1645866  

Hojatollah Adibi M. Shamooshaky Pouria Assar

In this paper, we present a computational method for solving boundary integral equations with loga-rithmic singular kernels which occur as reformulations of a boundary value problem for the Laplacian equation. Themethod is based on the use of the Galerkin method with CAS wavelets constructed on the unit interval as basis.This approach utilizes the non-uniform Gauss-Legendre quadrature rule for ...

Journal: :Informatica, Lith. Acad. Sci. 2008
Edmundas Kazimieras Zavadskas Zenonas Turskis

Multi-criteria decision making is used in many areas of human activities. Each alternative in multi-criteria decision making problem can be described by a set of criteria. Criteria can be qualitative and quantitative. They usually have different units of measurement and different optimization direction. The normalization aims at obtaining comparable scales of criteria values. The normalization ...

Journal: :Transactions of the Japan Society of Civil Engineers 1957

Journal: :European Journal of Operational Research 2016
Han-Lin Li Shu-Cherng Fang Yao-Huei Huang Tiantian Nie

Signomial programming problems with discrete variables (SPD) appear widely in real-life applications, but they are hard to solve. This paper proposes an enhanced logarithmic method to reformulate the SPD problem as a mixed 0-1 linear program (MILP) with a minimum number of binary variables and inequality constraints. Both of the theoretical analysis and numerical results strongly support its su...

Journal: :Discrete Mathematics 2008
Tomislav Doslic Darko Veljan

Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic behavior of some combinatorially relevant sequences, such as Motzkin and Schröder numbers, sequences of values of some classic orthogonal polynomials, and ma...

Journal: :J. Global Optimization 2011
Ronaldo Malheiros Gregório P. Roberto Oliveira

We present a proximal point method to solve multiobjective problems based on the scalarization for maps. We build a family of a convex scalar strict representation of a convex map F with respect to the lexicographic order on R and we add a variant of the logarithmquadratic regularization of Auslender, where the unconstrained variables in the domain of F are introduced on the quadratic term and ...

1993
D. den Hertog

Users may download and print one copy of any publication from the public portal for the purpose of private study or research You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal Take down policy If you believe that this document breaches copyright, please contact...

1994
Mart L. Molle

Recently, Ethernet celebrated its twentieth anniversary. Over those years, the processing speed of the attached hosts has increased by several orders of magnitude, to the point where the relative bandwidth of a 10 Mbps Ethernet has fallen from more than adequate to support large enterprise networks (whose utilizations were typically only a few percent, anyway), to marginally fast enough to supp...

Journal: :Adv. Comput. Math. 1998
Hideaki Kaneko Richard D. Noren Peter A. Padilla

In a recent paper [3], Y. Cao and Y. Xu established the Galerkin method for weakly singular Fredholm integral equations that preserves the singularity of the solution. Their Galerkin method provides a numerical solution that is a linear combination of a certain class of basis functions which includes elements that reflect the singularity of the solution. The purpose of this paper is to extend t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید