Research Outputs

Permanent URI for this communityhttps://hdl.handle.net/20.500.14288/2

Browse

Search Results

Now showing 1 - 10 of 77
  • Placeholder
    Publication
    ‘Anti-commutable’ local pre-Leibniz algebroids and admissible connections
    (Elsevier, 2023) Department of Physics; N/A; Dereli, Tekin; Doğan, Keremcan; Faculty Member; PhD Student; Department of Physics; College of Sciences; Graduate School of Sciences and Engineering; 201358; N/A
    The concept of algebroid is convenient as a basis for constructions of geometrical frameworks. For example, metric-affine and generalized geometries can be written on Lie and Courant algebroids, respectively. Furthermore, string theories might make use of many other algebroids such as metric algebroids, higher Courant algebroids, or conformal Courant algebroids. Working on the possibly most general algebroid structure, which generalizes many of the algebroids used in the literature, is fruitful as it creates a chance to study all of them at once. Local pre-Leibniz algebroids are such general ones in which metric-connection geometries are possible to construct. On the other hand, the existence of the 'locality operator', which is present for the left-Leibniz rule for the bracket, necessitates the modification of torsion and curvature operators in order to achieve tensorial quantities. In this paper, this modification of torsion and curvature is explained from the point of view that the modification is applied to the bracket instead. This leads one to consider 'anti-commutable' local pre-Leibniz algebroids which satisfy an anti-commutativity-like property defined with respect to a choice of an equivalence class of connections. These 'admissible' connections are claimed to be the necessary ones while working on a geometry of algebroids. This claim is due to the fact that one can prove many desirable properties and relations if one uses only admissible connections. For instance, for admissible connections, we prove the first and second Bianchi identities, Cartan structure equations, Cartan magic formula, the construction of Levi-Civita connections, the decomposition of connection in terms of torsion and non-metricity. These all are possible because the modified bracket becomes anti-symmetric for an admissible connection so that one can apply the machinery of almost-or pre-Lie algebroids. We investigate various algebroid structures from the literature and show that they admit admissible connections which are metric-compatible in some generalized sense. Moreover, we prove that local pre-Leibniz algebroids that are not anti-commutable cannot be equipped with a torsion-free, and in particular Levi-Civita, connection.
  • Placeholder
    Publication
    3D convective Cahn-Hilliard equation
    (Amer Inst Mathematical Sciences-Aims, 2007) Eden, Alp; Department of Mathematics; Kalantarov, Varga; Faculty Member; Department of Mathematics; College of Sciences; 117655
    We consider the initial boundary value problem for the 3D convective Cahn - Hilliard equation with periodic boundary conditions. This gives rise to a continuous dynamical system on L-2(ohm). Absorbing balls in L-2(ohm), H-per(1)(ohm) and H-per(2)(ohm) are shown to exist. Combining with the compactness property of the solution semigroup we conclude the existence of the global attractor. Restricting the dynamical system on the absorbing ball in H-per(2)(ohm) and using the general framework in Eden et. all. [] the existence of an exponential attractor is guaranteed. This approach also gives an explicit upper estimate of the dimension of the exponential attractor, albeit of the global attractor.
  • Thumbnail Image
    PublicationOpen Access
    A new consistent hybrid algorithm for solution of the PDF equations of turbulent reactive flow
    (American Institute of Physics (AIP) Publishing, 2013) Department of Mechanical Engineering; Sheikhsarmast, Reza Mokhtarpoor; Inmas, Shabrina Virta; Muradoğlu, Metin; Faculty Member; Department of Mechanical Engineering; Graduate School of Sciences and Engineering; College of Engineering; N/A; N/A; 46561
    This paper presents a newly developed consistent hybrid finite-volume (FV)/particle algorithm for solution of joint PDF (JPDF) model equation of turbulent reacting flows. In this approach, the open source FV package of OpenFOAM is employed to solve the Favre-averaged mean mass and momentum equations using pressure-based PISO algorithm while a particle-based Monte Carlo algorithm is used to solve the fluctuating velocity-turbulence frequency-compositions JPDF transport equation. In the earlier hybrid method [2, 3], a density-based FV algorithm was used to solve the mean flow equations but it has been found to be too dissipative and yet not very robust for incompressible or nearly incompressible flows mainly due to stiffness of the compressible flow equations in the low Mach number limit. In the this work, the density-based FV algorithm is first replaced with a pressure-based PISO algorithm to tackle this problem and then applied for simulation of the Sydney swirl stabilized bluff-body flame SM1. All the equations solved by the FV and particle algorithms are directly derived from the modeled JPDF transport equation so the present method is completely consistent at the level of governing equations. The position and velocity correction algorithms [3] are used to enforce full constancy at the numerical solution level. The results are found to be in a good agreement with the available experimental data and the recent computational results of De Meester et al. [1].
  • Placeholder
    Publication
    A remark about energy decay of a thermoelasticity problem
    (Inst Applied Mathematics, 2012) Meyvacı, M.; Department of Mathematics; Kalantarov, Varga; Faculty Member; Department of Mathematics; College of Sciences; 117655
    Under some restrictions on the parameters of the system we prove that solutions of the initial boundary value problem for the one dimensional porous - thermo - elasticity system of equations under consideration tend to zero as t -> 8 with an exponential rate.
  • Placeholder
    Publication
    A support function based algorithm for optimization with eigenvalue constraints
    (Siam Publications, 2017) N/A; Department of Mathematics; Mengi, Emre; Faculty Member; Department of Mathematics; College of Sciences; 113760
    Optimization of convex functions subject to eigenvalue constraints is intriguing because of peculiar analytical properties of eigenvalue functions and is of practical interest because of a wide range of applications in fields such as structural design and control theory. Here we focus on the optimization of a linear objective subject to a constraint on the smallest eigenvalue of an analytic and Hermitian matrix-valued function. We propose a numerical approach based on quadratic support functions that overestimate the smallest eigenvalue function globally. the quadratic support functions are derived by employing variational properties of the smallest eigenvalue function over a set of Hermitian matrices. We establish the local convergence of the algorithm under mild assumptions and deduce a precise rate of convergence result by viewing the algorithm as a fixed point iteration. the convergence analysis reveals that the algorithm is immune to the nonsmooth nature of the smallest eigenvalue. We illustrate the practical applicability of the algorithm on the pseudospectral functions.
  • Thumbnail Image
    PublicationOpen Access
    Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
    (Springer, 2015) Department of Industrial Engineering; Sağol, Gizem; Yıldırım, Emre Alper; Faculty Member; Department of Industrial Engineering; Graduate School of Sciences and Engineering; College of Engineering
    The problem of minimizing a quadratic form over the unit simplex, referred to as a standard quadratic optimization problem, admits an exact reformulation as a linear optimization problem over the convex cone of completely positive matrices. This computationally intractable cone can be approximated in various ways from the inside and from the outside by two sequences of nested tractable convex cones of increasing accuracy. In this paper, we focus on the inner polyhedral approximations due to YA +/- ldA +/- rA +/- m (Optim Methods Softw 27(1):155-173, 2012) and the outer polyhedral approximations due to de Klerk and Pasechnik (SIAM J Optim 12(4):875-892, 2002). We investigate the sequences of upper and lower bounds on the optimal value of a standard quadratic optimization problem arising from these two hierarchies of inner and outer polyhedral approximations. We give complete algebraic descriptions of the sets of instances on which upper and lower bounds are exact at any given finite level of the hierarchy. We identify the structural properties of the sets of instances on which upper and lower bounds converge to the optimal value only in the limit. We present several geometric and topological properties of these sets. Our results shed light on the strengths and limitations of these inner and outer polyhedral approximations in the context of standard quadratic optimization.
  • Placeholder
    Publication
    Anticyclotomic p-ordinary Iwasawa theory of elliptic modular forms
    (De Gruyter, 2018) Lei, Antonio; Department of Mathematics; Büyükboduk, Kazım; Faculty Member; Department of Mathematics; College of Sciences; N/A
    This is the first in a series of articles where we will study the Iwasawa theory of an elliptic modular form f along the anticyclotomic Z(p)-tower of an imaginary quadratic field K where the prime p splits completely. Our goal in this portion is to prove the Iwasawa main conjecture for suitable twists of f assuming that f is p-ordinary, both in the definite and indefinite setups simultaneously, via an analysis of Beilinson-Flach elements.
  • Thumbnail Image
    PublicationOpen Access
    Averages of values of L-series
    (American Mathematical Society (AMS), 2013) Ono, Ken; Department of Mathematics; Alkan, Emre; Faculty Member; Department of Mathematics; College of Sciences; 32803
    We obtain an exact formula for the average of values of L-series over two independent odd characters. The average of any positive moment of values at s = 1 is then expressed in terms of finite cotangent sums subject to congruence conditions. As consequences, bounds on such cotangent sums, limit points for the average of first moment of L-series at s = 1 and the average size of positive moments of character sums related to the class number are deduced.
  • Placeholder
    Publication
    Balanced and strongly balanced 4-kite designs
    (Utilitas Mathematica Publishing, 2013) Gionfriddo, Mario; Milazzo, Lorenzo; Department of Mathematics; Küçükçifçi, Selda; Faculty Member; Department of Mathematics; College of Sciences; 105252
    A G-design is called balanced if the degree of each vertex x is a constant. A G-design is called strongly balanced if for every i = 1, 2, ⋯, h, there exists a constant Ci such that dAi(x)= Ci for every vertex x, where AiS are the orbits of the automorphism group of G on its vertex-set and dAi(x) of a vertex is the number of blocks of containing x as an element of Ai. We say that a G-design is simply balanced if it is balanced, but not strongly balanced. In this paper we determine the spectrum of simply balanced and strongly balanced 4-kite designs.
  • Placeholder
    Publication
    Balancing the inverted pendulum using position feedback
    (Pergamon-Elsevier Science Ltd, 1999) Department of Mathematics; Atay, Fatihcan; Faculty Member; Department of Mathematics; College of Sciences; 253074
    It is shown how to obtain asymptotic stability in second-order undamped systems using time-delay action in the feedback of position. The effect of the delay is similar to derivative feedback in modifying the behavior of the system. Results are given on the selection of the controller parameters both in the absence and the presence of additional delay ill the feedback path. The timelag position feedback is shown to compare favorably with the conventional PD controller in terms of stability. (C) 1999 Elsevier Science Ltd. All rights reserved.