<p>Polynomial and rational eigenvalue problems arise in many applications. Linearization is a widely used method for solving these eigenvalue problems, and with various families of linearizations studied in the literature. Among these, Fiedler-like linearizations, specifically Fiedler pencils with repetition (FPRs) and generalized Fiedler pencils with repetition (GFPRs) are crucial for handling structured matrix polynomials. However, the methods for constructing these linearizations rely on matrix multiplications, which are computationally expensive and difficult to implement. This paper presents operation-free algorithms for constructing FPRs and GFPRs. These algorithms are further extended to construct linearizations for rational eigenvalue problems. We believe that these algorithms have significant potential for developing efficient computational toolboxes.</p>