19 resultados para problems in the real line
em Indian Institute of Science - Bangalore - Índia
Resumo:
A numerical procedure, based on the parametric differentiation and implicit finite difference scheme, has been developed for a class of problems in the boundary-layer theory for saddle-point regions. Here, the results are presented for the case of a three-dimensional stagnation-point flow with massive blowing. The method compares very well with other methods for particular cases (zero or small mass blowing). Results emphasize that the present numerical procedure is well suited for the solution of saddle-point flows with massive blowing, which could not be solved by other methods.
Resumo:
A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k, where each R-i is a closed interval on the real line of the form [a(j), a(i), + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph. It is known that for graph G, cub(G) <= left perpendicular2n/3right perpendicular. Recently it has been shown that for a graph G, cub(G) >= 4(Delta + 1) In n, where n and Delta are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G = (A boolean OR B, E) with |A| = n(1), |B| = n2, n(1) <= n(2), and Delta' = min {Delta(A),Delta(B)}, where Delta(A) = max(a is an element of A)d(a) and Delta(B) = max(b is an element of B) d(b), d(a) and d(b) being the degree of a and b in G, respectively , cub(G) <= 2(Delta' + 2) bar left rightln n(2)bar left arrow. We also give an efficient randomized algorithm to construct the cube representation of G in 3 (Delta' + 2) bar right arrowIn n(2)bar left arrow dimension. The reader may note that in general Delta' can be much smaller than Delta.
Resumo:
Bearing area analysis has been used to study the real area of contact and compliance of rough turned steel cylinders in compression. Calculations show that the elastic real area of contact is very small compared to the plastic real area of contact, and that local compliance due to flattening of asperity tips is a small proportion of the total compliance obtained from experiments. The fact that increased load brings more and more new asperities under load rather than enlarging the contact spots leads to a rather simple load-compliance relation for a rough cylinder, viz., W' = Nh · K1δn, where W0 = K1δn defines the load-compliance relation of the individual asperities, and Nh represents the number of asperities bearing the load.
Resumo:
We apply our technique of using a Rb-stabilized ring-cavity resonator to measure the frequencies of various spectral components in the 555.8-nm 1S0-->3P1 line of Yb. We determine the isotope shifts with 60 kHz precision, which is an order-of-magnitude improvement over the best previous measurement on this line. There are two overlapping transitions, 171Yb(1/2-->3/2) and 173Yb(5/2-->3/2), which we resolve by applying a magnetic field. We thus obtain the hyperfine constants in the 3P1 state of the odd isotopes with a significantly improved precision. Knowledge of isotope shifts and hyperfine structure should prove useful for high-precision calculations in Yb necessary to interpret ongoing experiments testing parity and time-reversal symmetry violation in the laws of physics.
Resumo:
When a uniform flow of any nature is interrupted, the readjustment of the flow results in concentrations and rare-factions, so that the peak value of the flow parameter will be higher than that which an elementary computation would suggest. When stress flow in a structure is interrupted, there are stress concentrations. These are generally localized and often large, in relation to the values indicated by simple equilibrium calculations. With the advent of the industrial revolution, dynamic and repeated loading of materials had become commonplace in engine parts and fast moving vehicles of locomotion. This led to serious fatigue failures arising from stress concentrations. Also, many metal forming processes, fabrication techniques and weak-link type safety systems benefit substantially from the intelligent use or avoidance, as appropriate, of stress concentrations. As a result, in the last 80 years, the study and and evaluation of stress concentrations has been a primary objective in the study of solid mechanics. Exact mathematical analysis of stress concentrations in finite bodies presents considerable difficulty for all but a few problems of infinite fields, concentric annuli and the like, treated under the presumption of small deformation, linear elasticity. A whole series of techniques have been developed to deal with different classes of shapes and domains, causes and sources of concentration, material behaviour, phenomenological formulation, etc. These include real and complex functions, conformal mapping, transform techniques, integral equations, finite differences and relaxation, and, more recently, the finite element methods. With the advent of large high speed computers, development of finite element concepts and a good understanding of functional analysis, it is now, in principle, possible to obtain with economy satisfactory solutions to a whole range of concentration problems by intelligently combining theory and computer application. An example is the hybridization of continuum concepts with computer based finite element formulations. This new situation also makes possible a more direct approach to the problem of design which is the primary purpose of most engineering analyses. The trend would appear to be clear: the computer will shape the theory, analysis and design.
Resumo:
An axis-parallel k-dimensional box is a Cartesian product R-1 x R-2 x...x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), b(i)] on the real line. For a graph G, its boxicity box(G) is the minimum dimension k, such that G is representable as the intersection graph of (axis-parallel) boxes in k-dimensional space. The concept of boxicity finds applications in various areas such as ecology, operations research etc. A number of NP-hard problems are either polynomial time solvable or have much better approximation ratio on low boxicity graphs. For example, the max-clique problem is polynomial time solvable on bounded boxicity graphs and the maximum independent set problem for boxicity d graphs, given a box representation, has a left perpendicular1 + 1/c log n right perpendicular(d-1) approximation ratio for any constant c >= 1 when d >= 2. In most cases, the first step usually is computing a low dimensional box representation of the given graph. Deciding whether the boxicity of a graph is at most 2 itself is NP-hard. We give an efficient randomized algorithm to construct a box representation of any graph G on n vertices in left perpendicular(Delta + 2) ln nright perpendicular dimensions, where Delta is the maximum degree of G. This algorithm implies that box(G) <= left perpendicular(Delta + 2) ln nright perpendicular for any graph G. Our bound is tight up to a factor of ln n. We also show that our randomized algorithm can be derandomized to get a polynomial time deterministic algorithm. Though our general upper bound is in terms of maximum degree Delta, we show that for almost all graphs on n vertices, their boxicity is O(d(av) ln n) where d(av) is the average degree.
Resumo:
A unit cube in k dimensions (k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k where R-i (for 1 <= i <= k) is a closed interval of the form [a(i), a(i) + 1] on the real line. A graph G on n nodes is said to be representable as the intersection of k-cubes (cube representation in k dimensions) if each vertex of C can be mapped to a k-cube such that two vertices are adjacent in G if and only if their corresponding k-cubes have a non-empty intersection. The cubicity of G denoted as cub(G) is the minimum k for which G can be represented as the intersection of k-cubes. An interesting aspect about cubicity is that many problems known to be NP-complete for general graphs have polynomial time deterministic algorithms or have good approximation ratios in graphs of low cubicity. In most of these algorithms, computing a low dimensional cube representation of the given graph is usually the first step. We give an O(bw . n) algorithm to compute the cube representation of a general graph G in bw + 1 dimensions given a bandwidth ordering of the vertices of G, where bw is the bandwidth of G. As a consequence, we get O(Delta) upper bounds on the cubicity of many well-known graph classes such as AT-free graphs, circular-arc graphs and cocomparability graphs which have O(Delta) bandwidth. Thus we have: 1. cub(G) <= 3 Delta - 1, if G is an AT-free graph. 2. cub(G) <= 2 Delta + 1, if G is a circular-arc graph. 3. cub(G) <= 2 Delta, if G is a cocomparability graph. Also for these graph classes, there axe constant factor approximation algorithms for bandwidth computation that generate orderings of vertices with O(Delta) width. We can thus generate the cube representation of such graphs in O(Delta) dimensions in polynomial time.
Resumo:
In this paper the problem of ignition and extinction has been formulated for the flow of a compressible fluid with Prandtl and Schmidt numbers taken as unity. In particular, the problems of (i) a jet impinging on a wall of combustible material and (ii) the opposed jet diffusion flame have been studied. In the wall jet case, three approximations in the momentum equation namely, (i) potential flow, (ii) viscous flow, (ii) viscous incompressible with k = 1 and (iii) Lees' approximation (taking pressure gradient terms zero) are studied. It is shown that the predictions of the mass flow rates at extinction are not very sensitive to the approximations made in the momentum equation. The effects of varying the wall temperature in the case (i) and the jet temperature in the case (ii) on the extinction speeds have been studied. The effects of varying the activation energy and the free stream oxidant concentration in case (ii), have also been investigated.
Resumo:
As is well known, when monochromatic light scattered by a liquid is examined under high resolution it exhibits a fine structure: an undisplaced central line and two lines on either side with wavelengths slightly different from that of the incident light. The appearance of the displaced components was first predicted by Brillouin1. On the basis of his theory, the observed displacements of frequency are regarded as a Doppler effect arising from the reflexion of the light wave by the progressive sound waves of thermal origin in the scattering medium. The frequency shift of the so-called Brillouin components is given by the formula where nu and c are the velocities of sound and light in the medium and theta is the angle of scattering. That the effect contemplated by Brillouin does arise in liquids and crystals is now a well-established experimental fact.
Resumo:
We present a generalized adaptive time-dependent density matrix renormalization-group (DMRG) scheme, called the double time window targeting (DTWT) technique, which gives accurate results with nominal computational resources, within reasonable computational time. This procedure originates from the amalgamation of the features of pace keeping DMRG algorithm, first proposed by Luo et al. [Phys. Rev. Lett. 91, 049701 (2003)] and the time-step targeting algorithm by Feiguin and White [Phys. Rev. B 72, 020404 (2005)]. Using the DTWT technique, we study the phenomena of spin-charge separation in conjugated polymers (materials for molecular electronics an spintronics), which have long-range electron-electron interactions and belong to the class of strongly correlated low-dimensional many-body systems. The issue of real-time dynamics within the Pariser-Parr-Pople (PPP) model which includes long-range electron correlations has not been addressed in the literature so far. The present study on PPP chains has revealed that, (i) long-range electron correlations enable both the charge and spin degree of freedom of the electron, to propagate faster in the PPP model compared to Hubbard model, (ii) for standard parameters of the PPP model as applied to conjugated polymers, the charge velocity is almost twice that of the spin velocity, and (iii) the simplistic interpretation of long-range correlations by merely renormalizing the U value of the Hubbard model fails to explain the dynamics of doped holes/electrons in the PPP model.
Resumo:
High-precision measurement of the electrical resistance of nickel along its critical line, a first attempt of this kind, as a function of pressure to 47.5 kbar is reported. Our analysis yields the values of the critical exponents α=α’=-0.115±0.005 and the amplitude ratios ‖A/A’‖=1.17±0.07 and ‖D/D’‖=1.2±0.1. These values are in close agreement with those predicted by renormalization-group (RG) theory. Moreover, this investigation provides an unambiguous experimental verification to one of the key consequences of RG theory that the critical exponents and amplitudes ratios are insensitive to pressure variation in nickel, a Heisenberg ferromagnet.
Resumo:
The present work involves a computational study of soot formation and transport in case of a laminar acetylene diffusion flame perturbed by a co nvecting line vortex. The topology of the soot contours (as in an earlier experimental work [4]) have been investigated. More soot was produced when vortex was introduced from the air si de in comparison to a fuel side vortex. Also the soot topography was more diffused in case of the air side vortex. The computational model was found to be in good agreement with the ex perimental work [4]. The computational simulation enabled a study of the various parameters affecting soot transport. Temperatures were found to be higher in case of air side vortex as compared to a fuel side vortex. In case of the fuel side vortex, abundance of fuel in the vort ex core resulted in stoichiometrically rich combustion in the vortex core, and more discrete so ot topography. Overall soot production too was low. In case of the air side vortex abundan ce of air in the core resulted in higher temperatures and more soot yield. Statistical techniques like probability density fun ction, correlation coefficient and conditional probability function were introduced to explain the transient dependence of soot yield and transport on various parameters like temperature, a cetylene concentration.
Resumo:
The present work involves a computational study of soot formation and transport in case of a laminar acetylene diffusion flame perturbed by a convecting line vortex. The topology of the soot contours (as in an earlier experimental work [4]) have been investigated. More soot was produced when vortex was introduced from the air side in comparison to a fuel side vortex. Also the soot topography was more diffused in case of the air side vortex. The computational model was found to be in good agreement with the experimental work [4]. The computational simulation enabled a study of the various parameters affecting soot transport. Temperatures were found to be higher in case of air side vortex as compared to a fuel side vortex. In case of the fuel side vortex, abundance of fuel in the vort ex core resulted in stoichiometrically rich combustion in the vortex core, and more discrete soot topography. Overall soot production too was low. In case of the air side vortex abundance of air in the core resulted in higher temperatures and more soot yield. Statistical techniques like probability density function, correlation coefficient and conditional probability function were introduced to explain the transient dependence of soot yield and transport on various parameters like temperature, a cetylene concentration.