Results 251 to 260 of about 2,811,643 (287)
Some of the next articles are maybe not open access.
The Methods of the Theory of Functions of Several Complex Variables
1991It is more difficult to construct holomorphic and meromorphic functions of several complex variables than those of one variable. Up to today they occur only as modular functions or Feynmanintegrals or functions with group symmetries if they depend properly on more than one variable. In general, the detailed analysis of such functions is very difficult.
openaire +1 more source
Journal of Mathematical Sciences, 1998
Solving a temperature problem of the theory of elasticity with a known thermoelastic potential is reduced to finding scalar- and vector-valued analytic functions of two complex variables that satisfy the boundary condition and are solutions of the basic and adjoint problems of elasticity theory respectively.
Ya. I. Burak, V. V. Pabirivs'kii
openaire +1 more source
Solving a temperature problem of the theory of elasticity with a known thermoelastic potential is reduced to finding scalar- and vector-valued analytic functions of two complex variables that satisfy the boundary condition and are solutions of the basic and adjoint problems of elasticity theory respectively.
Ya. I. Burak, V. V. Pabirivs'kii
openaire +1 more source
IEE Proceedings - Computers and Digital Techniques, 1995
An analysis is presented to predict the input variable subsets that give efficient disjunctive decompositions of complex combinatorial logic functions. A substantially smaller number of possible solutions, compared to all possible solutions, is predicted using a comparatively simple analysis, based on a count of the covers between tuples in the ...
J.T. Proudfoot, S.M. Ngwira
openaire +1 more source
An analysis is presented to predict the input variable subsets that give efficient disjunctive decompositions of complex combinatorial logic functions. A substantially smaller number of possible solutions, compared to all possible solutions, is predicted using a comparatively simple analysis, based on a count of the covers between tuples in the ...
J.T. Proudfoot, S.M. Ngwira
openaire +1 more source
Publications of the Research Institute for Mathematical Sciences, 1983
A method for evaluation of the error function of real and complex variable by means of a trapezoidal sum with a correction term is proposed. This method gives a result with high relative accuracy with small number of operations. A precise upper bound of the relative error of the approximation for real variable is given.
openaire +1 more source
A method for evaluation of the error function of real and complex variable by means of a trapezoidal sum with a correction term is proposed. This method gives a result with high relative accuracy with small number of operations. A precise upper bound of the relative error of the approximation for real variable is given.
openaire +1 more source
The method of the ternary complex based on three-variable rational interpolation function
Second International Conference on Applied Statistics, Computational Mathematics, and Software Engineering (ASCMSE 2023), 2023Bing Yang, Qiao Guo
openaire +1 more source
International Journal of Applied Mechanics
Based on conjugate basis functions, this paper proposes a novel improved complex variable reproducing kernel particle method (ICVRKPM) for elasticity problems. The approximation function of ICVRKPM is formulated using conjugate basis functions. Combining with the Galerkin weak form for elasticity problems and the implementation of displacement ...
Yaosheng Niu, Li Chen, Yumin Cheng
openaire +1 more source
Based on conjugate basis functions, this paper proposes a novel improved complex variable reproducing kernel particle method (ICVRKPM) for elasticity problems. The approximation function of ICVRKPM is formulated using conjugate basis functions. Combining with the Galerkin weak form for elasticity problems and the implementation of displacement ...
Yaosheng Niu, Li Chen, Yumin Cheng
openaire +1 more source
2005
Choice of ADPCM's step-size updating factors M has a sea capacity of computing that optimizes multi-variables with complex target function. There is the effective scheme such as GA or MEA but its convergence rate becomes too slowly in the neighborhood of peak value of multi-peak function to come away from local optimization.
Gang Zhang +3 more
openaire +1 more source
Choice of ADPCM's step-size updating factors M has a sea capacity of computing that optimizes multi-variables with complex target function. There is the effective scheme such as GA or MEA but its convergence rate becomes too slowly in the neighborhood of peak value of multi-peak function to come away from local optimization.
Gang Zhang +3 more
openaire +1 more source
Results in Mathematics, 1992
The author considers the additive Cousin problem in the restricted sense for a general linear differential equation \(L[u]=0\), i.e. the problem to construct global solutions \(u\) with given singularities. It is shown that a global solution of the inhomogeneous differential equation \(L[\lambda]=h\) can be obtained from local solutions by a smoothing ...
openaire +1 more source
The author considers the additive Cousin problem in the restricted sense for a general linear differential equation \(L[u]=0\), i.e. the problem to construct global solutions \(u\) with given singularities. It is shown that a global solution of the inhomogeneous differential equation \(L[\lambda]=h\) can be obtained from local solutions by a smoothing ...
openaire +1 more source